Makefile.dep
contrib
work
Makefile
config.h
dact.conf
config.log
config.cache
config.status
dact

Roy Keene <dact@rkeene.org>
	Idea, primary maintainer.
	dact.[ch], comp_plain.[ch], comp_delta.[ch], buffer.[ch],
	comp_luck.[ch], comp_zlib.[ch].

Jay Freeman <saurik@saurik.com>
	CVS help, build scripts, man page.
	Various patches (strsep(), patch-magic-file).

Toby Collier <tcollier@indifferent.com>
	README, ChangeLog

Daniel Vignes <dvignes@mac.com>
	int_sort:sort.[ch]

/LICENSE/1.2/Sat Sep 23 03:32:32 2000//
D/Docs////
D/comp_range////
/comp_bzlib.lnk/1.1/Mon Sep 25 09:26:20 2000//
/comp_mzlib.lnk/1.1/Mon Sep 25 09:26:20 2000//
/comp_mzlib2.lnk/1.1/Mon Sep 25 09:26:20 2000//
/comp_zlib.lnk/1.1/Mon Sep 25 09:26:20 2000//
/install-sh/1.1/Mon Sep 25 08:20:28 2000//
/.cvsignore/1.6/Tue Oct 10 15:39:51 2000//
/INSTALL/1.1/Sat Mar 24 15:33:16 2001//
/makesnapshot.sh/1.1/Sun Apr 22 00:56:57 2001//
/buffer.h/1.7/Mon Sep 10 02:52:37 2001//
/comp_bitsums.h/1.4/Mon Sep 10 02:52:37 2001//
/comp_bzlib.h/1.5/Mon Sep 10 02:52:37 2001//
/comp_delta.h/1.6/Mon Sep 10 02:52:37 2001//
/comp_factor.h/1.5/Mon Sep 10 02:52:37 2001//
/comp_fail.h/1.4/Mon Sep 10 02:52:37 2001//
/comp_mzlib.h/1.6/Mon Sep 10 02:52:37 2001//
/comp_mzlib2.h/1.6/Mon Sep 10 02:52:37 2001//
/comp_plain.h/1.4/Mon Sep 10 02:52:37 2001//
/comp_rle.h/1.6/Mon Sep 10 02:52:37 2001//
/comp_snibble.h/1.5/Mon Sep 10 02:52:37 2001//
/comp_text.h/1.6/Mon Sep 10 02:52:37 2001//
/crc.c/1.2/Mon Sep 10 02:52:37 2001//
/crc.h/1.3/Mon Sep 10 02:52:37 2001//
/math.h/1.3/Mon Sep 10 02:52:37 2001//
/sort.h/1.7/Mon Sep 10 02:52:37 2001//
/stdint.h/1.8/Mon Sep 10 02:52:37 2001//
/strsep.c/1.2/Mon Sep 10 02:52:37 2001//
/strsep.h/1.3/Mon Sep 10 02:52:37 2001//
/AUTHORS/1.9/Mon Sep 10 02:52:37 2001//
/ChangeLog/1.15/Mon Sep 10 02:52:37 2001//
/header.h/1.3/Sun Dec  2 23:52:28 2001//
/dendian.h/1.4/Sun Mar  3 21:23:18 2002//
/getopt.c/1.1/Wed Mar  6 19:51:59 2002//
/getopt.h/1.1/Wed Mar  6 19:51:59 2002//
/patch-magic-file/1.8/Mon Mar  4 16:13:06 2002//
/comp_textrle.h/1.1/Thu Apr 18 00:06:27 2002//
/cipher_serpent.h/1.2/Sat Jul  6 02:39:37 2002//
/ciphers.h/1.6/Sat Jul  6 02:54:30 2002//
/TODO/1.13/Sat Jul  6 03:12:39 2002//
/cipher_chaos.h/1.5/Sat Jul  6 05:51:10 2002//
/cipher_sub.h/1.5/Sat Jul  6 05:51:54 2002//
/comp_zlib.h/1.8/Fri Aug 30 05:19:50 2002//
/README/1.18/Thu Aug 29 17:54:16 2002//
/buffer.c/1.14/Thu Aug 29 16:37:48 2002//
/cipher_serpent.c/1.3/Thu Aug 29 16:05:09 2002//
/cipher_sub.c/1.12/Mon Sep 30 19:32:57 2002//
/comp_bitsums.c/1.7/Thu Aug 29 16:06:23 2002//
/comp_delta.c/1.11/Thu Aug 29 16:07:10 2002//
/comp_factor.c/1.9/Thu Aug 29 16:07:32 2002//
/comp_fail.c/1.6/Thu Aug 29 16:07:51 2002//
/comp_mzlib.c/1.12/Thu Aug 29 16:08:50 2002//
/comp_plain.c/1.8/Thu Aug 29 16:10:23 2002//
/comp_rle.c/1.13/Thu Aug 29 16:10:50 2002//
/comp_snibble.c/1.10/Thu Aug 29 16:11:23 2002//
/comp_text.c/1.10/Thu Aug 29 16:12:30 2002//
/comp_textrle.c/1.3/Thu Aug 29 16:12:56 2002//
/dendian.c/1.5/Thu Aug 29 16:55:32 2002//
/header.c/1.5/Thu Aug 29 16:16:04 2002//
/net.h/1.8/Thu Aug 29 16:57:14 2002//
/parse.h/1.13/Thu Aug 29 16:58:11 2002//
/sort.c/1.12/Thu Aug 29 16:19:25 2002//
/cipher_chaos.c/1.6/Fri Sep 27 04:29:51 2002//
/cipher_psub.c/1.3/Thu Aug 29 17:04:58 2002//
/cipher_psub.h/1.3/Thu Aug 29 16:52:50 2002//
/comp_mzlib2.c/1.15/Mon Sep 30 19:43:15 2002//
/comp_zlib.c/1.15/Mon Sep 30 19:00:50 2002//
/makearch.sh/1.5/Thu Aug 29 17:53:24 2002//
/net.c/1.13/Fri Sep 27 05:57:22 2002//
/ui.c/1.5/Mon Sep 30 19:38:30 2002//
/ui.h/1.4/Mon Sep 30 19:29:44 2002//
/win32.h/1.1/Fri Aug 30 02:56:52 2002//
/parse.c/1.22/Mon Sep 30 20:29:50 2002//
/comp_lzooy.lnk/1.1/Tue Oct  1 06:15:16 2002//
/comp_lzoox.lnk/1.1/Tue Oct  1 04:51:01 2002//
/comp_lzooy.h/1.1/Tue Oct  1 06:26:56 2002//
/comp_lzooy.c/1.1/Tue Oct  1 06:33:25 2002//
/comp_lzota.c/1.1/Tue Oct  1 06:30:45 2002//
/comp_lzota.h/1.1/Tue Oct  1 06:31:21 2002//
/comp_lzota.lnk/1.1/Tue Oct  1 06:29:37 2002//
/aclocal.m4/1.17/Tue Oct  1 05:53:03 2002//
/acconfig.h/1.13/Tue Oct  1 02:42:22 2002//
/algorithms.h/1.21/Tue Oct  1 06:31:49 2002//
/module.h/1.7/Tue Oct  1 06:57:25 2002//
/module.c/1.13/Tue Oct  1 07:31:09 2002//
/configure.in/1.17/Tue Oct  1 07:14:16 2002//
/config.h.in/1.19/Tue Oct  1 07:14:50 2002//
/configure/1.27/Tue Oct  1 07:38:16 2002//
/Makefile.in/1.44/Tue Oct  1 07:36:34 2002//
/dact.c/1.54/Tue Oct  1 07:37:59 2002//
/comp_bzlib.c/1.10/Tue Oct  1 08:09:50 2002//
/dact.h/1.46/Tue Oct  1 08:14:45 2002//
/comp_lzoox.h/1.1/Tue Oct  1 06:27:09 2002//
/comp_lzoox.c/1.1/Tue Oct  1 06:15:26 2002//

dact

:pserver:rkeene@cvs.saurik.com:/cvs/dact

20040220
 * Moved LZO-* out of DEBUG.

20031211
 * Started maintaining DACT again, version 0.8.31 released.

20010821
 * Added `-E' option to use with encryption
 * Added cipher subsystem
 * Added cipher_chaos.c  (Chaos cipher)

20010614
 * Added message to be displayed when upgrading DACT (with -N)
 * Added config option `block_size'

20010601
 * Added URL parsing support.
 * Added `-p' option to display the result of parsed URL.
 * Added `-N' option to upgrade DACT.

20010422
 * Added URL support.
 * Added `-H' option to write only the header of a DACT file.
 * Added extended header support.
 * Added `-n' option to ignore CRCs.
 * Added `-I' option to use only a specific algorithm and 0.
 * Added `-U' option to specify a file that contains a list of URLs.
 * Added `-u' option to specify an URL to download copy of real data.
 * Added `-D' option to specify a file description.
 * Added `-O' option to toggle the writing of original file name.
 * Added hooks for native `bunzip2' and `gunzip' handling.
 * Lots of bug fixes.
 * Version is 0.7.0.

20010325
 * Fixed bug with newer libbz2's (from Glenn McGrath <bug1@optushome.com.au>)
 * Changed comp_bzlib to 900k block (from Glenn McGrath <bug1@optushome.com.au>)
 * Added support for -C option, and decompression checking.
 * Version is 0.6.6

20010324
 * Fixed bugs in configure script
 * Fixed bugs in dact_blk_compress() (possibly causing heap corruption)
 * Changed magic number to be less likely to occur in a text file
 * Version is 0.6.5

20010322
 * Rewrote dact.c.
 * Made lots of changes to sort.[ch].
 * Decided to keep current algorithms system.
 * Changed magic number location in file to offset=0.
 * Completely dropped support for old DACT files.
 * New dact.c main(...) functions really similarily to `gzip.'
 * Using GNU configure stuffs.
 * comp_range and comp_mzlib2 are not enabled, they broke.
 * Block size limit is (theoretically) 4GB.
 * Changed structure of DACT file and block header.
 * The -C option doesn't work.
 * DACT doesn't check for a new binary (making a user dact-upgrade.sh
   pointless at the moment, but this will be fixed. )
 * Version is 0.6.1.
 * Began using CVS to break things more quickly.
 * Several misc bug fixes.

20000922
 * Added modules !
 * Converted all stable algorithms to modularizbale form.
 * Now uses a config file (/etc/dact.conf)
 * CHECK_VERSION is defined by default now (but disabled in dact.conf)
 * comp_mzlib2 works now.
 * Added a '-m' option to specify a config file.
 * update-version.sh renamed to dact-upgrade.sh and installed by `make install'

20000907
 * Added precompiled binaries, and a script to automatically upgrade.
 * Added Docs/helpfile.txt  which needs to be turned into a manpage.

20000905
 * Added "Bugs" and "Horror Stories" to README.
 * Fixed 2 bugs in comp_text.c.
 * Added Docs/  directory.
 * Changed CHECKSUM to MD5SUM
 * A VERSION now exists and is consulted to check for latest, use
   --with-check-version  option on configure script to enable.

20000828
 * Added backward compatability to <= 0.4.2.
 * Fixed patch to magic file.
 * Modified configuration scripts to work under more conditions.
 * Preliminary testing of endian-neutrality.
 * comp_mzlib2 modified, and almost works.
 * int_sort_fast() modified to be even faster.
 * Added path options to configure options.
 * Created an installation guide, INSTALL.
 * Added MD5 Checksum file, CHECKSUM.

20000827
 * Added preliminary support for endian-neutrality (UNTESTED!)
 * Added magic number, offset, and size.
 * Added patch to magic file.

20000720
 * Added getopt(3) support.
 * Added '-l' option.
 * Added '-s' option.
 * Changed archive name to dact-VER.
 * int_sort_really_fast added to sort.c.
 * Added '-e' option.
 * Fixed configure script to work with Solaris 8 (SunOS 5.8) (but not 7).
 * Some bugs were possibly fixed and created.
 * Added variable block size support.
 * Default block size is now 4088 bytes (Max is 16384).
 * Default output is to INFILE.dct instead of stdout.

20000526
 * Fixed several memory leaks.
 * Added bzlib.h check in configure for later use.
 * Added int_sort_really_fast to buffer.[ch]

20000515
 * comp_snibble.[ch] added as algo #6
 * comp_range.[ch] added as algo #7

20000514
 * comp_range_compress working (hopefully).
 * comp_range_decompress partially working.
 * int_sort_fast added to sort.c.
 * byte_buffer_* added to buffer.c.
 * configure script was modified.
 * comp_mzlib2 was removed from algorithms.h, to be readded as algo #8.
 * Added `-c' option and compression verification.

20000430
 * comp_range was modified to begin to get it to work
 * Modifications to configure script
 * comp_mzlib2 was started
 * Added sort.[ch] by Daniel Vignes (dvignes@n-f-d.com)

20000425
 * Configure no longer relies on sed
 * Binary filename changed from 'compress' to 'dact.'
 * Toby Collier (tcollier@n-f-d.com) begins
   handling documentation and Changelog.

20000421
 * Name changed from DCL to DACT.
 * New algorithms added.
 * Bugs fixed.

20000414
 * Initial release as DCL by Roy Keene (dact@rkeene.org)

/INSTALL/1.1/Sat Sep 23 03:42:46 2000//
/config_help.txt/1.1/Sat Sep 23 03:47:24 2000//
/dact.txt/1.2/Thu Mar 22 02:34:17 2001//
/dact.1/1.4/Wed Mar  6 19:46:50 2002//
/helpfile.txt/1.5/Wed Mar  6 19:46:37 2002//
D

dact/Docs

:pserver:rkeene@cvs.saurik.com:/cvs/dact

DACT Installation Guide

$ ./configure
$ make
$ su
$ make install
   (note, the default installation location is /usr/local,
    make sure you have proper privileges to write there.)

`configure' configures this package to adapt to many kinds of systems.

Usage: ./configure [OPTION]... [VAR=VALUE]...

To assign environment variables (e.g., CC, CFLAGS...), specify them as
VAR=VALUE.  See below for descriptions of some of the useful variables.

Defaults for the options are specified in brackets.

Configuration:
  -h, --help              display this help and exit
      --help=short        display options specific to this package
      --help=recursive    display the short help of all the included packages
  -V, --version           display version information and exit
  -q, --quiet, --silent   do not print `checking...' messages
      --cache-file=FILE   cache test results in FILE [disabled]
  -C, --config-cache      alias for `--cache-file=config.cache'
  -n, --no-create         do not create output files
      --srcdir=DIR        find the sources in DIR [configure dir or `..']

Installation directories:
  --prefix=PREFIX         install architecture-independent files in PREFIX
                          [/usr/local]
  --exec-prefix=EPREFIX   install architecture-dependent files in EPREFIX
                          [PREFIX]

By default, `make install' will install all the files in
`/usr/local/bin', `/usr/local/lib' etc.  You can specify
an installation prefix other than `/usr/local' using `--prefix',
for instance `--prefix=$HOME'.

For better control, use the options below.

Fine tuning of the installation directories:
  --bindir=DIR           user executables [EPREFIX/bin]
  --sbindir=DIR          system admin executables [EPREFIX/sbin]
  --libexecdir=DIR       program executables [EPREFIX/libexec]
  --datadir=DIR          read-only architecture-independent data [PREFIX/share]
  --sysconfdir=DIR       read-only single-machine data [PREFIX/etc]
  --sharedstatedir=DIR   modifiable architecture-independent data [PREFIX/com]
  --localstatedir=DIR    modifiable single-machine data [PREFIX/var]
  --libdir=DIR           object code libraries [EPREFIX/lib]
  --includedir=DIR       C header files [PREFIX/include]
  --oldincludedir=DIR    C header files for non-gcc [/usr/include]
  --infodir=DIR          info documentation [PREFIX/info]
  --mandir=DIR           man documentation [PREFIX/man]

Optional Features:
  --disable-FEATURE       do not include FEATURE (same as --enable-FEATURE=no)
  --enable-FEATURE[=ARG]  include FEATURE [ARG=yes]
  --disable-chkvers       Completely disable the ability to check for new versions
  --disable-network       Disable DACT's network activity completely
  --enable-debug          Enable developmental code
  --disable-modules       Disable use of modules
  --enable-debianupgrade  Use the Debian upgrade procedure instead of the DACT one

Some influential environment variables:
  CC          C compiler command
  CFLAGS      C compiler flags
  LDFLAGS     linker flags, e.g. -L<lib dir> if you have libraries in a
              nonstandard directory <lib dir>
  CPPFLAGS    C/C++ preprocessor flags, e.g. -I<include dir> if you have
              headers in a nonstandard directory <include dir>
  CPP         C preprocessor

Use these variables to override the choices made by `configure' or to help
it to find libraries and programs with nonstandard names/locations.

.PU
.TH DACT 1
.SH NAME
dact \- compress or expand a file, or stream
.SH SYNOPSIS
.ll +10
.B dact
.RB [ " \-dsfcvlniCHOShVNa " ]
.RB [ \-b\ size ]
.RB [ \-e\ algo ]
.RB [ \-m\ file ]
.RB [ \-o\ file ]
.RB [ \-u\ url ]
.RB [ \-p\ url ]
.RB [ \-M\ command ]
.RB [ \-D\ desc ]
.RB [ \-I\ algo ]
.RB [ \-U\ file ]
.RB [ \-E\ cipher ]
.RB [ "file ..." ]
.ll -10
.SH DESCRIPTION
.I DACT
reduces input files by attempting to compress each block
of the file with several different algorithms and selects the
best one for each block.

.SH OPTIONS
.TP
.B \-d
Decompress the file (or stdin, if no file is given), removing
the extention if it has a valid one.
.TP
.B \-s
Display statistics about the file, such as:
Magic number of file, DACT version file was compressed with, Block size used to compress file, Compressed file size, Original file's size, Compression ratio (uncompressed to compressed), File's original name, CRCs (if available).
.TP
.B \-f
Force bad and unsafe things to happen.  Can be combined to
make even worse things happen.  One `-f' allows overwriting of
existing files, two `-f' allows you to ignore bad magic and
CRC check fails.
.TP
.B \-c
Send output to stdout, this will allow you to force DACT to
send compressed output to a terminal or result of compressing
a file to a pipe.
.TP
.B \-v
Increase verbosity, can be combined to increase verbosity a
lot.  Currently, only up to 3 makes sense.  One `-v' displays
a bar graph.  Two `-v' displays a bar graph and block
information.  Three `-v' displays a bar graph and detailed
compression statistics per block.
.TP
.B \-l
List compression algorithms available.
.TP
.B \-n
Toggle use of CRCs.  This option is especially useful when
combined with the network capabilities of DACT.  It allows
you to create a compressed file with only the header pointing
to an web page that contains the real DACT file (which
normally has it's CRCs checked against the compressed header
to ensure they're the same file), with this option the files
do not have to be from the same source (i.e., you can have
an updated copy automatically extend itself.)
.TP
.B \-i
Read input from standard input instead of /dev/tty.  This is used to read user supplied information like encryption keys and passwords from standard input instead of the more appropriate method of opening "/dev/tty."
.TP
.B \-C
Complain when compression errors occur.  When a block is
selected, it is tested to ensure that it decompresses back
to the original source.  If it fails, the algorithm is not
used, with this option you are informed of the failure.
.TP
.B \-H
Write only header (no data).  This option is useful for
distributing archives that need only reside on the internet
someplace.
.TP
.B \-O
Toggle writing original file name in the DACT header. This
has no real use that I know of.
.TP
.B \-S
Use speed-size as a metric rather than size.  This is not
implemented yet.  This will make DACT create an optimized
compressed file, balancing speed of decompression with size.
.TP
.B \-h
Give usage synopsis.
.TP
.B \-V
Display DACT version.
.TP
.B \-N
Upgrade DACT.  This option will fetch the latest binary from
the internet and place it in $HOME/.dact/ as dact.bin.  If
you have `binary_check on' in your dact.conf file, DACT will
check for this file and use it.  If you have Debian and run
`dact -N'   as root the Debian upgrade procedure will upgrade
your entire system.
.TP
.B \-a
DACT modules.  This option will fetch the latest modules from the internet and place them in $HOME/.dact/ in a subdirectory cooresponding to your Operating System and CPU Architecture.
.TP
.B \-b\ size
Use the specified block size to compress the file.  This
option's parameters is in bytes.
.TP
.B \-e\ num
Exclude an algorithm from being used.  This option is useful
if you know your target will not be able to decompress a
certain algorithm (you can get their numbers from the `-l'
option.)
.TP
.B \-m\ file
Load another config file.  This option will attempt to load
the specified file in addition to the normal files, the
options in this file will supercede other options.
.TP
.B \-o\ file
Alternate output.  This option sends output to a file instead
of INFILE.dct.  The file can also be a URL or '-' for standard
out.
.TP
.B \-u\ url
This option will encode an URL in the compressed file's header,
this URL will be tried (and CRCs checked) before attempting to
decompress the data in the actual file.
.TP
.B \-p\ url
URLs in DACT can have variables in them that will be expanded when network access is required, this allows you to test the results of that extrapolation easily.  Variables and their values are:
    @@OSNM@@        OS Name (linux, freebsd, sunos, etc)
    @@OSVR@@        OS version (2.2.x, 4.2, 5.8, etc)
    @@OSVS@@        OS version (short) (2.2, 4.2, 5.8, etc)
    @@ARCH@@        Arch (i386, sparc64, sun4u, sun4m, etc)
    @@DIST@@        If OSNM=Linux, distribution of Linux.
    @@FILE@@        Name of compressed file.
    @@DTVR@@        Version of DACT (maj.min.rev)
    @@DTVS@@        Version of DACT (short) (maj.min)
    @@PASS@@        Prompt for Password
    @@USER@@        Prompt for Username
    @@ATSN@@        Put an `@'
  example:
    dact -p http://www.rkeene.org/devel/dact/precompiled/dact-@@OSNM@@-@@OSVS@@-@@ARCH@@.bin
    dact: http://www.rkeene.org/devel/dact/precompiled/dact-linux-2.4-i586.bin
.TP
.B \-M\ command
This option executes a command from the command line as if it appeared in "dact.conf".
.TP
.B \-D\ desc
Encode the description specified into the header of the
compressed file.
.TP
.B \-I\ num
Use only 1 algorithm (and uncompressed as a fall-back), useful
if you want to limit yourself to a certain type of compression.
.TP
.B \-U\ file
Encode the specified file into the header of the compressed
file.  This file will be searched (line-by-line) for a working
URL to download compressed content from.  See also `-u.'
.TP
.B \-E\ cipher
Enable encryption using the specified algorithm, different
algorithms use different authentication methods.

.SH FILES
  $HOME/.dact/
  $HOME/.dact/dact.conf
  /usr/etc/dact.conf

.SH "SEE ALSO"
gzip(1), bzip2(1), mcrypt(3)

.SH AUTHOR
.Sp
Roy Keene
.I <dact@rkeene.org>

DACT(1)                                                                DACT(1)



NAME
       dact - compress or expand a file, or stream

SYNOPSIS
       dact  [  -dsfcvlniCHOShVNa  ]  [-b size]  [-e algo]  [-m file] [-o file] [-u url]
       [-p url] [-M command] [-D desc] [-I algo] [-U file] [-E cipher] [file ...]

DESCRIPTION
       DACT reduces input files by attempting to compress each  block  of  the
       file  with  several  different  algorithms and selects the best one for
       each block.


OPTIONS
       -d     Decompress the file (or stdin, if no file  is  given),  removing
              the extention if it has a valid one.

       -s     Display  statistics  about  the  file,  such as: Magic number of
              file, DACT version file was compressed with, Block size used  to
              compress  file, Compressed file size, Original file's size, Com-
              pression ratio (uncompressed  to  compressed),  File's  original
              name, CRCs (if available).

       -f     Force  bad and unsafe things to happen.  Can be combined to make
              even worse things happen.  One `-f' allows overwriting of exist-
              ing files, two `-f' allows you to ignore bad magic and CRC check
              fails.

       -c     Send output to stdout, this will allow you to force DACT to send
              compressed  output to a terminal or result of compressing a file
              to a pipe.

       -v     Increase verbosity, can be combined to increase verbosity a lot.
              Currently,  only  up  to 3 makes sense.  One `-v' displays a bar
              graph.  Two `-v' displays a bar  graph  and  block  information.
              Three `-v' displays a bar graph and detailed compression statis-
              tics per block.

       -l     List compression algorithms available.

       -n     Toggle use of CRCs.  This option is especially useful when  com-
              bined  with  the network capabilities of DACT.  It allows you to
              create a compressed file with only the header pointing to an web
              page  that  contains the real DACT file (which normally has it's
              CRCs checked against the compressed header to ensure they're the
              same  file),  with  this option the files do not have to be from
              the same source (i.e., you can have an  updated  copy  automati-
              cally extend itself.)

       -i     Read  input  from  standard  input instead of /dev/tty.  This is
              used to read user supplied information like encryption keys  and
              passwords  from  standard  input instead of the more appropriate
              method of opening "/dev/tty."

       -C     Complain  when  compression  errors  occur.   When  a  block  is
              selected,  it  is  tested to ensure that it decompresses back to
              the original source.  If it fails, the algorithm  is  not  used,
              with this option you are informed of the failure.

       -H     Write  only  header  (no  data).  This option is useful for dis-
              tributing archives that need only reside on the  internet  some-
              place.

       -O     Toggle  writing  original file name in the DACT header. This has
              no real use that I know of.

       -S     Use speed-size as a metric rather than size.  This is not imple-
              mented  yet.  This will make DACT create an optimized compressed
              file, balancing speed of decompression with size.

       -h     Give usage synopsis.

       -V     Display DACT version.

       -N     Upgrade DACT.  This option will fetch the latest binary from the
              internet  and place it in $HOME/.dact/ as dact.bin.  If you have
              `binary_check on' in your dact.conf file, DACT  will  check  for
              this file and use it.  If you have Debian and run `dact -N'   as
              root the Debian upgrade procedure will upgrade your entire  sys-
              tem.

       -a     DACT  modules.   This  option will fetch the latest modules from
              the internet and place them in $HOME/.dact/  in  a  subdirectory
              cooresponding to your Operating System and CPU Architecture.

       -b size
              Use  the  specified  block  size  to  compress  the  file.  This
              option's parameters is in bytes.

       -e num Exclude an algorithm from being used.  This option is useful  if
              you  know  your  target will not be able to decompress a certain
              algorithm (you can get their numbers from the `-l' option.)

       -m file
              Load another config file.  This option will attempt to load  the
              specified  file  in addition to the normal files, the options in
              this file will supercede other options.

       -o file
              Alternate output.  This option sends output to a file instead of
              INFILE.dct.  The file can also be a URL or '-' for standard out.

       -u url This option will encode an URL in the compressed file's  header,
              this  URL  will be tried (and CRCs checked) before attempting to
              decompress the data in the actual file.

       -p url URLs in DACT can have variables in them that  will  be  expanded
              when  network  access  is  required, this allows you to test the
              results of that extrapolation easily.  Variables and their  val-
              ues are:
                  @@OSNM@@        OS Name (linux, freebsd, sunos, etc)
                  @@OSVR@@        OS version (2.2.x, 4.2, 5.8, etc)
                  @@OSVS@@        OS version (short) (2.2, 4.2, 5.8, etc)
                  @@ARCH@@        Arch (i386, sparc64, sun4u, sun4m, etc)
                  @@DIST@@        If OSNM=Linux, distribution of Linux.
                  @@FILE@@        Name of compressed file.
                  @@DTVR@@        Version of DACT (maj.min.rev)
                  @@DTVS@@        Version of DACT (short) (maj.min)
                  @@PASS@@        Prompt for Password
                  @@USER@@        Prompt for Username
                  @@ATSN@@        Put an `@'
                example:
                  dact       -p       http://www.rkeene.org/devel/dact/precom-
              piled/dact-@@OSNM@@-@@OSVS@@-@@ARCH@@.bin
                  dact:     http://www.rkeene.org/devel/dact/precompiled/dact-
              linux-2.4-i586.bin

       -M command
              This  option  executes  a command from the command line as if it
              appeared in "dact.conf".

       -D desc
              Encode the description specified into the  header  of  the  com-
              pressed file.

       -I num Use  only  1 algorithm (and uncompressed as a fall-back), useful
              if you want to limit yourself to a certain type of  compression.

       -U file
              Encode  the  specified  file  into  the header of the compressed
              file.  This file will be searched (line-by-line) for  a  working
              URL to download compressed content from.  See also `-u.'

       -E cipher
              Enable encryption using the specified algorithm, different algo-
              rithms use different authentication methods.


FILES
         $HOME/.dact/
         $HOME/.dact/dact.conf
         /usr/etc/dact.conf


SEE ALSO
       gzip(1), bzip2(1), mcrypt(3)


AUTHOR
       Roy Keene <dact@rkeene.org>



                                                                       DACT(1)

	A Brief Discussion of the History and Operation of
	the DACT Compression engine.


History:
	DACT started out as a science fair project on "Lossless
Compression of Arbitrary Data."  A feat which (to me) seemed like it
should be possible, but I later realized why it could not be[1].  From
there, I decided that a compression program that knew different file
types and had a dictionary of compression algorithms to use for each file
type.  So I began writing a program to do this, but I was too lazy to do
some magic identification, or base it on the file's extension.  So, this
program instead compressed each block with all known algorithms, finding
the smallest overall file size.  The next logical step was to make it test
each algorithm on each block.

Operation:
	DACT takes a block (of arbitrary size, specified by the user) from
a file, compresses it with all of the compression algorithms in it's
dictionary, finding the one that yields the lowest size. It provides a
simple interface for creating new algorithms.

Questions?  Comments?  Code/Document Contribution?  Feel free to contact
me at rkeene@rkeene.org.

DACT(1)                                                                DACT(1)



NNAAMMEE
       dact - compress or expand a file, or stream

SSYYNNOOPPSSIISS
       ddaacctt  [  --ddssffccvvllnniiCCHHOOSShhVVNNaa  ]  [--bb ssiizzee]  [--ee aallggoo]  [--mm ffiillee] [--oo ffiillee] [--uu uurrll]
       [--pp uurrll] [--MM ccoommmmaanndd] [--DD ddeesscc] [--II aallggoo] [--UU ffiillee] [--EE cciipphheerr] [ffiillee ......]

DDEESSCCRRIIPPTTIIOONN
       _D_A_C_T reduces input files by attempting to compress each  block  of  the
       file  with  several  different  algorithms and selects the best one for
       each block.


OOPPTTIIOONNSS
       --dd     Decompress the file (or stdin, if no file  is  given),  removing
              the extention if it has a valid one.

       --ss     Display  statistics  about  the  file,  such as: Magic number of
              file, DACT version file was compressed with, Block size used  to
              compress  file, Compressed file size, Original file's size, Com-
              pression ratio (uncompressed  to  compressed),  File's  original
              name, CRCs (if available).

       --ff     Force  bad and unsafe things to happen.  Can be combined to make
              even worse things happen.  One `-f' allows overwriting of exist-
              ing files, two `-f' allows you to ignore bad magic and CRC check
              fails.

       --cc     Send output to stdout, this will allow you to force DACT to send
              compressed  output to a terminal or result of compressing a file
              to a pipe.

       --vv     Increase verbosity, can be combined to increase verbosity a lot.
              Currently,  only  up  to 3 makes sense.  One `-v' displays a bar
              graph.  Two `-v' displays a bar  graph  and  block  information.
              Three `-v' displays a bar graph and detailed compression statis-
              tics per block.

       --ll     List compression algorithms available.

       --nn     Toggle use of CRCs.  This option is especially useful when  com-
              bined  with  the network capabilities of DACT.  It allows you to
              create a compressed file with only the header pointing to an web
              page  that  contains the real DACT file (which normally has it's
              CRCs checked against the compressed header to ensure they're the
              same  file),  with  this option the files do not have to be from
              the same source (i.e., you can have an  updated  copy  automati-
              cally extend itself.)

       --ii     Read  input  from  standard  input instead of /dev/tty.  This is
              used to read user supplied information like encryption keys  and
              passwords  from  standard  input instead of the more appropriate
              method of opening "/dev/tty."

       --CC     Complain  when  compression  errors  occur.   When  a  block  is
              selected,  it  is  tested to ensure that it decompresses back to
              the original source.  If it fails, the algorithm  is  not  used,
              with this option you are informed of the failure.

       --HH     Write  only  header  (no  data).  This option is useful for dis-
              tributing archives that need only reside on the  internet  some-
              place.

       --OO     Toggle  writing  original file name in the DACT header. This has
              no real use that I know of.

       --SS     Use speed-size as a metric rather than size.  This is not imple-
              mented  yet.  This will make DACT create an optimized compressed
              file, balancing speed of decompression with size.

       --hh     Give usage synopsis.

       --VV     Display DACT version.

       --NN     Upgrade DACT.  This option will fetch the latest binary from the
              internet  and place it in $HOME/.dact/ as dact.bin.  If you have
              `binary_check on' in your dact.conf file, DACT  will  check  for
              this file and use it.  If you have Debian and run `dact -N'   as
              root the Debian upgrade procedure will upgrade your entire  sys-
              tem.

       --aa     DACT  modules.   This  option will fetch the latest modules from
              the internet and place them in $HOME/.dact/  in  a  subdirectory
              cooresponding to your Operating System and CPU Architecture.

       --bb ssiizzee
              Use  the  specified  block  size  to  compress  the  file.  This
              option's parameters is in bytes.

       --ee nnuumm Exclude an algorithm from being used.  This option is useful  if
              you  know  your  target will not be able to decompress a certain
              algorithm (you can get their numbers from the `-l' option.)

       --mm ffiillee
              Load another config file.  This option will attempt to load  the
              specified  file  in addition to the normal files, the options in
              this file will supercede other options.

       --oo ffiillee
              Alternate output.  This option sends output to a file instead of
              INFILE.dct.  The file can also be a URL or '-' for standard out.

       --uu uurrll This option will encode an URL in the compressed file's  header,
              this  URL  will be tried (and CRCs checked) before attempting to
              decompress the data in the actual file.

       --pp uurrll URLs in DACT can have variables in them that  will  be  expanded
              when  network  access  is  required, this allows you to test the
              results of that extrapolation easily.  Variables and their  val-
              ues are:
                  @@OSNM@@        OS Name (linux, freebsd, sunos, etc)
                  @@OSVR@@        OS version (2.2.x, 4.2, 5.8, etc)
                  @@OSVS@@        OS version (short) (2.2, 4.2, 5.8, etc)
                  @@ARCH@@        Arch (i386, sparc64, sun4u, sun4m, etc)
                  @@DIST@@        If OSNM=Linux, distribution of Linux.
                  @@FILE@@        Name of compressed file.
                  @@DTVR@@        Version of DACT (maj.min.rev)
                  @@DTVS@@        Version of DACT (short) (maj.min)
                  @@PASS@@        Prompt for Password
                  @@USER@@        Prompt for Username
                  @@ATSN@@        Put an `@'
                example:
                  dact       -p       http://www.rkeene.org/devel/dact/precom-
              piled/dact-@@OSNM@@-@@OSVS@@-@@ARCH@@.bin
                  dact:     http://www.rkeene.org/devel/dact/precompiled/dact-
              linux-2.4-i586.bin

       --MM ccoommmmaanndd
              This  option  executes  a command from the command line as if it
              appeared in "dact.conf".

       --DD ddeesscc
              Encode the description specified into the  header  of  the  com-
              pressed file.

       --II nnuumm Use  only  1 algorithm (and uncompressed as a fall-back), useful
              if you want to limit yourself to a certain type of  compression.

       --UU ffiillee
              Encode  the  specified  file  into  the header of the compressed
              file.  This file will be searched (line-by-line) for  a  working
              URL to download compressed content from.  See also `-u.'

       --EE cciipphheerr
              Enable encryption using the specified algorithm, different algo-
              rithms use different authentication methods.


FFIILLEESS
         $HOME/.dact/
         $HOME/.dact/dact.conf
         /usr/etc/dact.conf


SSEEEE AALLSSOO
       gzip(1), bzip2(1), mcrypt(3)


AAUUTTHHOORR
       Roy Keene _<_d_a_c_t_@_r_k_e_e_n_e_._o_r_g_>



                                                                       DACT(1)

#! /bin/bash

MANWIDTH=80 man -l -Tascii $1 | sed s/'.[]'/''/g > $1.txt

                        DYNAMIC ADAPTIVE COMPRESSION TOOL
                                 DACT @@VERS@@

Release information:
  pkg:  DACT version @@VERS@@
  url:  http://www.rkeene.org/files/oss/@@UTIL@@/@@UTIL@@-@@VERS@@.tar.gz
  web:  http://www.rkeene.org/oss/@@UTIL@@/
  date: @@DATE@@
--------------------------------------------------------------------------

DACT Installation Guide

$ ./configure
$ make
$ su
$ make install
   (note, the default installation location is /usr/local,
    make sure you have proper privileges to write there.)

GNU GENERAL PUBLIC LICENSE

   Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
59 Temple Place - Suite 330, Boston, MA  02111-1307, USA

Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.

Preamble

   The licenses for most software are designed to take away your freedom
   to share and change it. By contrast, the GNU General Public License is
   intended to guarantee your freedom to share and change free
   software--to make sure the software is free for all its users. This
   General Public License applies to most of the Free Software
   Foundation's software and to any other program whose authors commit to
   using it. (Some other Free Software Foundation software is covered by
   the GNU Library General Public License instead.) You can apply it to
   your programs, too.
   
   When we speak of free software, we are referring to freedom, not
   price. Our General Public Licenses are designed to make sure that you
   have the freedom to distribute copies of free software (and charge for
   this service if you wish), that you receive source code or can get it
   if you want it, that you can change the software or use pieces of it
   in new free programs; and that you know you can do these things.
   
   To protect your rights, we need to make restrictions that forbid
   anyone to deny you these rights or to ask you to surrender the rights.
   These restrictions translate to certain responsibilities for you if
   you distribute copies of the software, or if you modify it.
   
   For example, if you distribute copies of such a program, whether
   gratis or for a fee, you must give the recipients all the rights that
   you have. You must make sure that they, too, receive or can get the
   source code. And you must show them these terms so they know their
   rights.
   
   We protect your rights with two steps: (1) copyright the software, and
   (2) offer you this license which gives you legal permission to copy,
   distribute and/or modify the software.
   
   Also, for each author's protection and ours, we want to make certain
   that everyone understands that there is no warranty for this free
   software. If the software is modified by someone else and passed on,
   we want its recipients to know that what they have is not the
   original, so that any problems introduced by others will not reflect
   on the original authors' reputations.
   
   Finally, any free program is threatened constantly by software
   patents. We wish to avoid the danger that redistributors of a free
   program will individually obtain patent licenses, in effect making the
   program proprietary. To prevent this, we have made it clear that any
   patent must be licensed for everyone's free use or not licensed at
   all.
   
   The precise terms and conditions for copying, distribution and
   modification follow.
   
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION

   0. This License applies to any program or other work which contains a
   notice placed by the copyright holder saying it may be distributed
   under the terms of this General Public License. The "Program", below,
   refers to any such program or work, and a "work based on the Program"
   means either the Program or any derivative work under copyright law:
   that is to say, a work containing the Program or a portion of it,
   either verbatim or with modifications and/or translated into another
   language. (Hereinafter, translation is included without limitation in
   the term "modification".) Each licensee is addressed as "you".
   
   Activities other than copying, distribution and modification are not
   covered by this License; they are outside its scope. The act of
   running the Program is not restricted, and the output from the Program
   is covered only if its contents constitute a work based on the Program
   (independent of having been made by running the Program). Whether that
   is true depends on what the Program does.
   
   1. You may copy and distribute verbatim copies of the Program's source
   code as you receive it, in any medium, provided that you conspicuously
   and appropriately publish on each copy an appropriate copyright notice
   and disclaimer of warranty; keep intact all the notices that refer to
   this License and to the absence of any warranty; and give any other
   recipients of the Program a copy of this License along with the
   Program.
   
   You may charge a fee for the physical act of transferring a copy, and
   you may at your option offer warranty protection in exchange for a
   fee.
   
   2. You may modify your copy or copies of the Program or any portion of
   it, thus forming a work based on the Program, and copy and distribute
   such modifications or work under the terms of Section 1 above,
   provided that you also meet all of these conditions:
   
     * a) You must cause the modified files to carry prominent notices
       stating that you changed the files and the date of any change.
     * b) You must cause any work that you distribute or publish, that in
       whole or in part contains or is derived from the Program or any
       part thereof, to be licensed as a whole at no charge to all third
       parties under the terms of this License.
     * c) If the modified program normally reads commands interactively
       when run, you must cause it, when started running for such
       interactive use in the most ordinary way, to print or display an
       announcement including an appropriate copyright notice and a
       notice that there is no warranty (or else, saying that you provide
       a warranty) and that users may redistribute the program under
       these conditions, and telling the user how to view a copy of this
       License. (Exception: if the Program itself is interactive but does
       not normally print such an announcement, your work based on the
       Program is not required to print an announcement.)
       
   These requirements apply to the modified work as a whole. If
   identifiable sections of that work are not derived from the Program,
   and can be reasonably considered independent and separate works in
   themselves, then this License, and its terms, do not apply to those
   sections when you distribute them as separate works. But when you
   distribute the same sections as part of a whole which is a work based
   on the Program, the distribution of the whole must be on the terms of
   this License, whose permissions for other licensees extend to the
   entire whole, and thus to each and every part regardless of who wrote
   it.
   
   Thus, it is not the intent of this section to claim rights or contest
   your rights to work written entirely by you; rather, the intent is to
   exercise the right to control the distribution of derivative or
   collective works based on the Program.
   
   In addition, mere aggregation of another work not based on the Program
   with the Program (or with a work based on the Program) on a volume of
   a storage or distribution medium does not bring the other work under
   the scope of this License.
   
   3. You may copy and distribute the Program (or a work based on it,
   under Section 2) in object code or executable form under the terms of
   Sections 1 and 2 above provided that you also do one of the following:
     * a) Accompany it with the complete corresponding machine-readable
       source code, which must be distributed under the terms of Sections
       1 and 2 above on a medium customarily used for software
       interchange; or,
     * b) Accompany it with a written offer, valid for at least three
       years, to give any third party, for a charge no more than your
       cost of physically performing source distribution, a complete
       machine-readable copy of the corresponding source code, to be
       distributed under the terms of Sections 1 and 2 above on a medium
       customarily used for software interchange; or,
     * c) Accompany it with the information you received as to the offer
       to distribute corresponding source code. (This alternative is
       allowed only for noncommercial distribution and only if you
       received the program in object code or executable form with such
       an offer, in accord with Subsection b above.)
       
   The source code for a work means the preferred form of the work for
   making modifications to it. For an executable work, complete source
   code means all the source code for all modules it contains, plus any
   associated interface definition files, plus the scripts used to
   control compilation and installation of the executable. However, as a
   special exception, the source code distributed need not include
   anything that is normally distributed (in either source or binary
   form) with the major components (compiler, kernel, and so on) of the
   operating system on which the executable runs, unless that component
   itself accompanies the executable.
   
   If distribution of executable or object code is made by offering
   access to copy from a designated place, then offering equivalent
   access to copy the source code from the same place counts as
   distribution of the source code, even though third parties are not
   compelled to copy the source along with the object code.
   
   4. You may not copy, modify, sublicense, or distribute the Program
   except as expressly provided under this License. Any attempt otherwise
   to copy, modify, sublicense or distribute the Program is void, and
   will automatically terminate your rights under this License. However,
   parties who have received copies, or rights, from you under this
   License will not have their licenses terminated so long as such
   parties remain in full compliance.
   
   5. You are not required to accept this License, since you have not
   signed it. However, nothing else grants you permission to modify or
   distribute the Program or its derivative works. These actions are
   prohibited by law if you do not accept this License. Therefore, by
   modifying or distributing the Program (or any work based on the
   Program), you indicate your acceptance of this License to do so, and
   all its terms and conditions for copying, distributing or modifying
   the Program or works based on it.
   
   6. Each time you redistribute the Program (or any work based on the
   Program), the recipient automatically receives a license from the
   original licensor to copy, distribute or modify the Program subject to
   these terms and conditions. You may not impose any further
   restrictions on the recipients' exercise of the rights granted herein.
   You are not responsible for enforcing compliance by third parties to
   this License.
   
   7. If, as a consequence of a court judgment or allegation of patent
   infringement or for any other reason (not limited to patent issues),
   conditions are imposed on you (whether by court order, agreement or
   otherwise) that contradict the conditions of this License, they do not
   excuse you from the conditions of this License. If you cannot
   distribute so as to satisfy simultaneously your obligations under this
   License and any other pertinent obligations, then as a consequence you
   may not distribute the Program at all. For example, if a patent
   license would not permit royalty-free redistribution of the Program by
   all those who receive copies directly or indirectly through you, then
   the only way you could satisfy both it and this License would be to
   refrain entirely from distribution of the Program.
   
   If any portion of this section is held invalid or unenforceable under
   any particular circumstance, the balance of the section is intended to
   apply and the section as a whole is intended to apply in other
   circumstances.
   
   It is not the purpose of this section to induce you to infringe any
   patents or other property right claims or to contest validity of any
   such claims; this section has the sole purpose of protecting the
   integrity of the free software distribution system, which is
   implemented by public license practices. Many people have made
   generous contributions to the wide range of software distributed
   through that system in reliance on consistent application of that
   system; it is up to the author/donor to decide if he or she is willing
   to distribute software through any other system and a licensee cannot
   impose that choice.
   
   This section is intended to make thoroughly clear what is believed to
   be a consequence of the rest of this License.
   
   8. If the distribution and/or use of the Program is restricted in
   certain countries either by patents or by copyrighted interfaces, the
   original copyright holder who places the Program under this License
   may add an explicit geographical distribution limitation excluding
   those countries, so that distribution is permitted only in or among
   countries not thus excluded. In such case, this License incorporates
   the limitation as if written in the body of this License.
   
   9. The Free Software Foundation may publish revised and/or new
   versions of the General Public License from time to time. Such new
   versions will be similar in spirit to the present version, but may
   differ in detail to address new problems or concerns.
   
   Each version is given a distinguishing version number. If the Program
   specifies a version number of this License which applies to it and
   "any later version", you have the option of following the terms and
   conditions either of that version or of any later version published by
   the Free Software Foundation. If the Program does not specify a
   version number of this License, you may choose any version ever
   published by the Free Software Foundation.
   
   10. If you wish to incorporate parts of the Program into other free
   programs whose distribution conditions are different, write to the
   author to ask for permission. For software which is copyrighted by the
   Free Software Foundation, write to the Free Software Foundation; we
   sometimes make exceptions for this. Our decision will be guided by the
   two goals of preserving the free status of all derivatives of our free
   software and of promoting the sharing and reuse of software generally.
   
   NO WARRANTY
   
   11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO
   WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
   EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
   OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY
   KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
   IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
   PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
   PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
   THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
   
   12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
   WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
   AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU
   FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
   CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
   PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
   RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
   FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF
   SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
   DAMAGES.
   
END OF TERMS AND CONDITIONS

comp_snibble.o: comp_snibble.c dact.h config.h comp_fail.h comp_snibble.h \
  buffer.h sort.h
comp_delta.o: comp_delta.c dact.h config.h comp_fail.h comp_delta.h \
  buffer.h
comp_text.o: comp_text.c dact.h config.h comp_fail.h comp_text.h buffer.h
comp_rle.o: comp_rle.c dact.h config.h comp_fail.h comp_rle.h
cipher_chaos.o: cipher_chaos.c dact.h config.h comp_fail.h ui.h \
  cipher_chaos.h
cipher_sub.o: cipher_sub.c cipher_sub.h dact.h config.h comp_fail.h \
  parse.h ui.h
cipher_psub.o: cipher_psub.c dact.h config.h comp_fail.h cipher_psub.h \
  parse.h ui.h
comp_lzoox.o: comp_lzoox.c dact.h config.h comp_fail.h comp_lzoox.h
comp_lzooy.o: comp_lzooy.c dact.h config.h comp_fail.h comp_lzooy.h
comp_lzota.o: comp_lzota.c dact.h config.h comp_fail.h comp_lzota.h
comp_bzlib.o: comp_bzlib.c dact.h config.h comp_fail.h comp_bzlib.h
comp_zlib.o: comp_zlib.c dact.h config.h comp_fail.h comp_zlib.h
comp_mzlib.o: comp_mzlib.c dact.h config.h comp_fail.h comp_mzlib.h
comp_mzlib2.o: comp_mzlib2.c dact.h config.h comp_fail.h comp_mzlib2.h
dact_common.o: dact_common.c dact.h config.h comp_fail.h parse.h \
  dendian.h crc.h math.h dact_common.h algorithms.h comp_plain.h \
  comp_rle.h comp_delta.h comp_zlib.h comp_mzlib.h comp_mzlib2.h \
  comp_bzlib.h comp_snibble.h comp_text.h comp_lzoox.h comp_lzooy.h \
  comp_lzota.h ciphers.h cipher_chaos.h cipher_sub.h cipher_serpent.h \
  cipher_psub.h module.h header.h net.h ui.h
comp_fail.o: comp_fail.c dact.h config.h comp_fail.h
comp_plain.o: comp_plain.c dact.h config.h comp_fail.h comp_plain.h
buffer.o: buffer.c dact.h config.h comp_fail.h buffer.h
header.o: header.c dact.h config.h comp_fail.h header.h
sort.o: sort.c dact.h config.h comp_fail.h sort.h
dact.o: dact.c dact.h config.h comp_fail.h parse.h dendian.h crc.h math.h \
  dact_common.h algorithms.h comp_plain.h comp_rle.h comp_delta.h \
  comp_zlib.h comp_mzlib.h comp_mzlib2.h comp_bzlib.h comp_snibble.h \
  comp_text.h comp_lzoox.h comp_lzooy.h comp_lzota.h ciphers.h \
  cipher_chaos.h cipher_sub.h cipher_serpent.h cipher_psub.h module.h \
  header.h net.h ui.h
module.o: module.c dact.h config.h comp_fail.h module.h algorithms.h \
  comp_plain.h comp_rle.h comp_delta.h comp_zlib.h comp_mzlib.h \
  comp_mzlib2.h comp_bzlib.h comp_snibble.h comp_text.h comp_lzoox.h \
  comp_lzooy.h comp_lzota.h ciphers.h cipher_chaos.h cipher_sub.h \
  cipher_serpent.h cipher_psub.h parse.h net.h ui.h
parse.o: parse.c dact.h config.h comp_fail.h buffer.h parse.h crc.h ui.h
dendian.o: dendian.c dact.h config.h comp_fail.h dendian.h
crc.o: crc.c dact.h config.h comp_fail.h crc.h
net.o: net.c dact.h config.h comp_fail.h net.h parse.h crc.h
ui.o: ui.c dact.h config.h comp_fail.h ui.h
dact.o: dact.c dact.h config.h comp_fail.h parse.h dendian.h crc.h math.h \
  dact_common.h algorithms.h comp_plain.h comp_rle.h comp_delta.h \
  comp_zlib.h comp_mzlib.h comp_mzlib2.h comp_bzlib.h comp_snibble.h \
  comp_text.h comp_lzoox.h comp_lzooy.h comp_lzota.h ciphers.h \
  cipher_chaos.h cipher_sub.h cipher_serpent.h cipher_psub.h module.h \
  header.h net.h ui.h
comp_snibble.so: comp_snibble.c dact.h config.h comp_fail.h comp_snibble.h \
  buffer.h sort.h
comp_delta.so: comp_delta.c dact.h config.h comp_fail.h comp_delta.h \
  buffer.h
comp_text.so: comp_text.c dact.h config.h comp_fail.h comp_text.h buffer.h
comp_rle.so: comp_rle.c dact.h config.h comp_fail.h comp_rle.h
cipher_chaos.so: cipher_chaos.c dact.h config.h comp_fail.h ui.h \
  cipher_chaos.h
cipher_sub.so: cipher_sub.c cipher_sub.h dact.h config.h comp_fail.h \
  parse.h ui.h
cipher_psub.so: cipher_psub.c dact.h config.h comp_fail.h cipher_psub.h \
  parse.h ui.h
comp_lzoox.so: comp_lzoox.c dact.h config.h comp_fail.h comp_lzoox.h
comp_lzooy.so: comp_lzooy.c dact.h config.h comp_fail.h comp_lzooy.h
comp_lzota.so: comp_lzota.c dact.h config.h comp_fail.h comp_lzota.h
comp_bzlib.so: comp_bzlib.c dact.h config.h comp_fail.h comp_bzlib.h
comp_zlib.so: comp_zlib.c dact.h config.h comp_fail.h comp_zlib.h
comp_mzlib.so: comp_mzlib.c dact.h config.h comp_fail.h comp_mzlib.h
comp_mzlib2.so: comp_mzlib2.c dact.h config.h comp_fail.h comp_mzlib2.h
dact_common.so: dact_common.c dact.h config.h comp_fail.h parse.h \
  dendian.h crc.h math.h dact_common.h algorithms.h comp_plain.h \
  comp_rle.h comp_delta.h comp_zlib.h comp_mzlib.h comp_mzlib2.h \
  comp_bzlib.h comp_snibble.h comp_text.h comp_lzoox.h comp_lzooy.h \
  comp_lzota.h ciphers.h cipher_chaos.h cipher_sub.h cipher_serpent.h \
  cipher_psub.h module.h header.h net.h ui.h
comp_fail.so: comp_fail.c dact.h config.h comp_fail.h
comp_plain.so: comp_plain.c dact.h config.h comp_fail.h comp_plain.h
buffer.so: buffer.c dact.h config.h comp_fail.h buffer.h
header.so: header.c dact.h config.h comp_fail.h header.h
sort.so: sort.c dact.h config.h comp_fail.h sort.h
dact.so: dact.c dact.h config.h comp_fail.h parse.h dendian.h crc.h math.h \
  dact_common.h algorithms.h comp_plain.h comp_rle.h comp_delta.h \
  comp_zlib.h comp_mzlib.h comp_mzlib2.h comp_bzlib.h comp_snibble.h \
  comp_text.h comp_lzoox.h comp_lzooy.h comp_lzota.h ciphers.h \
  cipher_chaos.h cipher_sub.h cipher_serpent.h cipher_psub.h module.h \
  header.h net.h ui.h
module.so: module.c dact.h config.h comp_fail.h module.h algorithms.h \
  comp_plain.h comp_rle.h comp_delta.h comp_zlib.h comp_mzlib.h \
  comp_mzlib2.h comp_bzlib.h comp_snibble.h comp_text.h comp_lzoox.h \
  comp_lzooy.h comp_lzota.h ciphers.h cipher_chaos.h cipher_sub.h \
  cipher_serpent.h cipher_psub.h parse.h net.h ui.h
parse.so: parse.c dact.h config.h comp_fail.h buffer.h parse.h crc.h ui.h
dendian.so: dendian.c dact.h config.h comp_fail.h dendian.h
crc.so: crc.c dact.h config.h comp_fail.h crc.h
net.so: net.c dact.h config.h comp_fail.h net.h parse.h crc.h
ui.so: ui.c dact.h config.h comp_fail.h ui.h
dact.so: dact.c dact.h config.h comp_fail.h parse.h dendian.h crc.h math.h \
  dact_common.h algorithms.h comp_plain.h comp_rle.h comp_delta.h \
  comp_zlib.h comp_mzlib.h comp_mzlib2.h comp_bzlib.h comp_snibble.h \
  comp_text.h comp_lzoox.h comp_lzooy.h comp_lzota.h ciphers.h \
  cipher_chaos.h cipher_sub.h cipher_serpent.h cipher_psub.h module.h \
  header.h net.h ui.h

CC = @CC@
CFLAGS = @CFLAGS@ @DEFS@
CPPFLAGS = @CPPFLAGS@

EXEEXT = @EXEEXT@
OBJEXT = @OBJEXT@
PATH_SEPARATOR = @PATH_SEPARATOR@

LD = @CC@
LOADLIBES = 
LDLIBS += @LIBS@ @MODLIBS@ -lm @NOMODS@ @MODLIBSCOND@
LDFLAGS += @LDFLAGS@

MODLIBS = @MODLIBS@

INSTALL = @INSTALL@
@SET_MAKE@

prefix = @prefix@
mandir = @mandir@
sysconfdir = @sysconfdir@
datadir = @datadir@
exec_prefix = @exec_prefix@
bindir = @bindir@

CONF = $(sysconfdir)/dact.conf
CFLAGS += -DDACT_CONFIG_FILE=\"$(CONF)\" -DEXEEXT=\"$(EXEEXT)\"
#CFLAGS += -O3
#LDFLAGS += -static

DEBUGALGO = comp_bitsums.c comp_factor.c comp_textrle.c
OBJS += dact_common.o comp_fail.o comp_plain.o buffer.o header.o sort.o dact.o module.o parse.o dendian.o crc.o net.o ui.o @LIBOBJS@
ALGO = comp_snibble.c comp_delta.c comp_text.c comp_rle.c cipher_chaos.c cipher_sub.c cipher_psub.c @ALGO@


all: @DEFAULT@

module: @DEPEND@
	@MODS="$(ALGO:.c=.so)" LDLIBS="@ALLMODLIBS@" \
	  $(MAKE) dact libdact.so dact.conf

static: @DEPEND@
	@OBJS="$(ALGO:.c=.o) $(CR_OBJ)" LDLIBS="$(MODLIBS)" $(MAKE) dact libdact.so dact.conf

dact.conf: Makefile
	@echo "version_check    off" > dact.conf
	@echo "#block_size      0" >> dact.conf
	@echo "#exclude_algo    0" >> dact.conf
	@echo "use_urls         on" >> dact.conf
	@echo "color_ui         off" >> dact.conf
	@echo "network_access   on" >> dact.conf
	@echo "binary_check     off" >> dact.conf
	@echo "module_dir       $(datadir)/dact" >> dact.conf
	@echo "module_load_all  off" >> dact.conf
@MODS@	@for so in $(MODS:.so=); do echo "load_module	$$so" >> dact.conf; done

dact: $(OBJS) $(MODS)
	$(CC) $(OBJS) $(LDFLAGS) $(LIBS) $(LDLIBS) -o dact$(EXEEXT)

libdact.so: $(OBJS) libdact.o
@MODS@	@echo $(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) -o $@ @SHARED@ $(filter-out dact.c, $(^:.o=.c)); \
	$(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) -o $@ @SHARED@ $(filter-out dact.c, $(^:.o=.c))
	@true

%.so: %.c %.lnk
	@echo $(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) -o $@ -DAS_MODULE @SHARED@ $< $(filter %.o, $^) `cat $(<:.c=.lnk)`; \
	$(CC) $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) -o $@ -DAS_MODULE @SHARED@ $< $(filter %.o, $^) `cat $(<:.c=.lnk)`

clean:
	rm -f dact dact$(EXEEXT) $(OBJS) libdact.so libdact.o core *~ $(ALGO:.c=.o) $(ALGO:.c=.so)

distclean: clean
	rm -f Makefile config.h config.status config.log config.cache

mrproper: distclean
	rm -rf Makefile.dep configure autom4te.cache/ config.h.in

install-bin: dact
	$(INSTALL) -m 755 dact$(EXEEXT) $(bindir)/dact$(EXEEXT)

install: all install-bin
	$(INSTALL) -m 644 dact.conf $(CONF)
	$(INSTALL) -m 644 Docs/dact.1 $(mandir)/man1/dact.1
@MODS@	mkdir -p -m 755 $(datadir)/dact
@MODS@	for so in *.so; do $(INSTALL) -m 755 $$so $(datadir)/dact/$$so; done
	./patch-magic-file $(datadir)/magic

install-bin-local: dact
	mkdir -p  $(HOME)/.dact/`uname -s | tr A-Z a-z`-`uname -m`
	$(INSTALL) -m 755 dact$(EXEEXT) $(HOME)/.dact/`uname -s | tr A-Z a-z`-`uname -m`/dact$(EXEEXT)

install-local: all install-bin-local
	$(INSTALL) -m 644 dact.conf $(HOME)/.dact/dact.conf
@MODS@	for so in *.so; do $(INSTALL) -m 755 $$so $(HOME)/.dact/`uname -s | tr A-Z a-z`-`uname -m`/$$so; done

uninstall:
	rm -f $(bindir)/dact$(EXEEXT)
	rm -f $(mandir)/man1/dact.1 $(CONF)
@MODS@	rm -rf $(datadir)/dact

depend: Makefile.dep

Makefile.dep: *.c *.h Makefile
	@echo "building Makefile.dep"
	@$(CC) $(CFLAGS) $(CPPFLAGS) -MM $(ALGO) $(OBJS:.o=.c) $(MODS:.so=.c) dact.c  | tee Makefile.dep | sed -e "s/^\([^ ]*\)\.o: /\1.so: /g" >> Makefile.dep

include Makefile.dep

1. EXPLANATION:

	Take file, compress each block with 1 of 256 algorithms (including
no compression) and use algorithm on a per block basis.


2. WARNING!  You should never use an algorithm listed in algorithms.h under DEBUG for real data, they are subject to reordering, recoding, and removal.


3. FEEDBACK would be appreciated.  Email me, dact@rkeene.org,
	if you find a flaw in the code, or if you have a suggestion.


4. WRITING A COMPRESSION ALGORITHM FOR DACT:

	a. You can use comp_plain.[ch] as an example for the interface.
	b. Your function must take 5 parameters:
	        mode            - DACT_MODE_COMPR or DACT_MODE_DECMP
                	            Determine whether to compress or decompress.
        	prev_block      - Previous (uncompressed) block.
	        curr_block      - The data to be compressed.
	        out_block       - Where to put data after compression.
	        blk_size        - Size of prev_block and curr_block.
	c. Add your function's header file to algorithms.h:
		#include "comp_youralgorithm.h"
	d. Add your function's call to algorithms[] in algorithms.h, before
	     the NULL:
		comp_yourfunction_algo,
	e. Add your function's code to the Makefile.in (if it has no depencies):
		ALGO+=comp_yourfunction.o

5. Horror Stories:

	a. Comp_range didn't compile under Solaris 8 using C WorkShop 6.0.

	b. Compiled Successfully, but shared binary didn't work.

	c. Failed to make a Static binary under Slackware 7.0.

6. Bugs:

	a. Please submit all bugs to dact@rkeene.org

Finish writing dact.conf options handlers

a. Archive
b. Pre/Post Install script

# x. Darwin:  Does not set file permissions (fixed)
y. Does not handle large files
z. Does not store original file permissions.

i. auto-upgrade for modules
ii. fix modules everywhere
iii. sign modules
iv. default to modules
v. module version stuff
vi. commercial modules

1. Get more compression algorithms
2. factor
3. --> lha (not GPL)
4. --> arj (not GPL)
5. --> rar (not GPL, shareware)
6. lzw 
7. Document code.
...
n. Write better documentation.

From bugoptushome.com.au Thu May 10 21:40:21 2001
Date: Sun, 06 May 2001 17:46:35 +1000
From: Glenn McGrath <bugoptushome.com.au>
To: Roy Keene <dactrkeene.org>
Subject: dact: replacing tar

Hello again, some more thoughts for you to consider.

.tar.gz really sucks, im writting some code that works on files inside a
.tar.gz in busybox and its a real hassle, i have to fork and uncompress
in a child process and feed the uncompressed data back the main function
that can untar it.

The problem stems from the fact that the tar file is compressed rather
than the individual files, if people did .gz.tar that it would be easy
to work on individual files within the archive, but it wouldnt get as
good compression due to the probably reduced block size (if the files
are small).

The loss in compression from appending files compressed with dact
probably wouldnt be as bad as .tar.gz as dact can take advantage of
different compresion methods for small files.

The real reason i would like to see this could also tie in well with
your url idea that you have been working on.

If dact something like an index file that had a list of filenames, their
offset and compressed size, then it would be possible to download and
unpack only one file within an archive.

e.g. linux-2.4.4.tar.gz is about 20MB, say i want to look at the
./README file, to do so i have to download the entire 20MB, uncompress
it, untar it, then access README.

In would be good to start the download of linux-2.4.4.dct and read
untill the end of the index section of the file and close the connection
(or have the index file seperate), then with the index file i would know
where abouts in the linux-2.4.4.dct the ./README file starts, so we
could open a connection and start resuming the download from the offset
of the ./README, rather than from the start of the file.

You have mentioned you had ideas for combining multiple compressed
files, so hopefully something like this could be worked into your plans.


Glenn

AC_DEFUN(DC_PROG_GCC, [
  AC_SUBST(DEPEND)

  if test -n "$GCC"; then
    CFLAGS="$CFLAGS -Wall"
    DEPEND="Makefile.dep"
  fi
])

AC_DEFUN(DC_CHK_URANDOM, [
  if test "$cross_compiling" = "no"; then
    AC_MSG_CHECKING(to see if you have /dev/urandom)
    if test -r "/dev/urandom"; then
      AC_MSG_RESULT(yes)
      AC_DEFINE([HAVE_DEV_URANDOM], [], [Have random device?])
    else
      AC_MSG_RESULT(no)
    fi
  fi
])

AC_DEFUN(DC_CHK_MODULE, [
  AC_SUBST(ALGO)
  AC_SUBST(MODLIBS)

  AC_CHECK_LIB($1, main, [
    ALGO="$2 $ALGO"
    MODLIBS="-l$1 $MODLIBS"
    AC_DEFINE($3, [], [Something])
  ])
])

AC_DEFUN(DC_CHK_MODULE_VAR, [
  AC_SUBST(ALGO)
  AC_SUBST($4)

  AC_CHECK_LIB($1, main, [
    ALGO="$2 $ALGO"
    $4="-l$1 $(eval echo $(echo \$$4))"
    AC_DEFINE($3, [], [Also something])
  ])
])

AC_DEFUN(DC_DO_NETSET, [
  AC_SEARCH_LIBS(socket, socket nsl)
  AC_SEARCH_LIBS(gethostbyname, nsl)
  AC_SEARCH_LIBS(inet_aton, xnet, AC_DEFINE(HAVE_INET_ATON, [], [Have inet_aton() ?]), AC_SEARCH_LIBS(inet_addr, nsl))
])


AC_DEFUN(DC_ASK_CHKVERS, [
  AC_ARG_ENABLE(chkvers, [  --disable-chkvers       Completely disable the ability to check for new versions], [
    case "$enableval" in
      no)
      ;;
      *)
  AC_DEFINE(CHECK_VERSION, [], [Check for new versions over the network?])
      ;;
    esac
  ], AC_DEFINE(CHECK_VERSION, [], [Check for new versions over the network?]))
])

AC_DEFUN(DC_ASK_DEBIAN, [
  AC_ARG_ENABLE(debianupgrade, [  --enable-debianupgrade  Use the Debian upgrade procedure instead of the DACT one], [
    case "$enableval" in
      no)
      ;;
      *)
  		AC_DEFINE(DACT_DEBIAN_UPGRADE_PROC, [], [Use the Debian upgrade procedure instead of DACTs internal one])
      ;;
    esac
  ])
])

AC_DEFUN(DC_ASK_NETWORK, [
  AC_ARG_ENABLE(network, [  --disable-network       Disable DACT's network activity completely], [
    case "$enableval" in
      no)
	AC_DEFINE(NO_NETWORK, [], [Disable all network support])
      ;;
      *)
	DC_DO_NETSET
      ;;
    esac
  ], DC_DO_NETSET )
])

AC_DEFUN(DC_DO_DEBUG, [
  ALGO="$ALGO \$(DEBUGALGO)"
  AC_DEFINE(DEBUG, [1], [Debug])
])

AC_DEFUN(DC_ASK_DEBUG, [
  AC_ARG_ENABLE(debug, [  --enable-debug          Enable developmental code], [
    if test "$enable_version" != "no"; then
      DC_DO_DEBUG
    fi
  ], [
    case "`uname -n`" in
      rkeene | unleaded | *.saurik.com )
	DC_DO_DEBUG
      ;;
    esac
  ])
])

AC_DEFUN(DC_NO_MODULE, [
  DEFAULT="static"
  MODS="# "
])

AC_DEFUN(DC_GET_SHARED, [
  AC_SUBST(SHARED)

  OLD_LDFLAGS="$LDFLAGS"
  SHARED=""
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared -Wl,-G,-z,textoff -rdynamic -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -Wl,-G,-z,textoff -fPIC"; ADD_LDFLAGS="-rdynamic" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared -Wl,-G,-z,textoff -rdynamic"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -Wl,-G,-z,textoff"; ADD_LDFLAGS="-rdynamic" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared -Wl,-G,-z,textoff -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -Wl,-G,-z,textoff -fPIC"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared -Wl,-G,-z,textoff"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -Wl,-G,-z,textoff"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -Wl,-G,-z,textoff -rdynamic -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-Wl,-G,-z,textoff -fPIC"; ADD_LDFLAGS="-rdynamic" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -Wl,-G,-z,textoff -rdynamic"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-Wl,-G,-z,textoff"; ADD_LDFLAGS="-rdynamic" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -Wl,-G,-z,textoff -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-Wl,-G,-z,textoff -fPIC"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -Wl,-G,-z,textoff"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-Wl,-G,-z,textoff"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$LDFLAGS -shared -rdynamic -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -fPIC"; ADD_LDFLAGS="-rdynamic" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared -fPIC"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared -fPIC"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  if test -z "$SHARED"; then
    LDFLAGS="$OLD_LDFLAGS -shared"
    AC_TRY_LINK([#include <stdio.h>], [ printf("okay\n"); return(0); ], [ SHARED="-shared"; ADD_LDFLAGS="" ], SHARED="", SHARED="");
  fi
  LDFLAGS="$ADD_LDFLAGS $OLD_LDFLAGS"
])


AC_DEFUN(DC_ASK_MODULE, [
  AC_SUBST(DEFAULT)
  AC_SUBST(MODS)
  AC_SUBST(NOMODS)

  DC_CHK_DLOPEN
  AC_MSG_CHECKING(to use modules)
  AC_ARG_ENABLE(modules, [  --disable-modules       Disable use of modules], [
    case "$enableval" in
      no)
	AC_MSG_RESULT(no)
	DC_NO_MODULE
      ;;
      *)
	DC_GET_SHARED
	if test "$HAVEDLOPEN" = yes -a -n "$SHARED"; then
	  AC_MSG_RESULT(yes)
	  AC_DEFINE(USE_MODULES, [], [Enable use of dynamically loadable modules?])
          NOMODS="#"
	  DEFAULT="module"
	else
	  AC_MSG_RESULT(can't)
	  DC_NO_MODULE
	fi
      ;;
    esac
  ], [
	DC_GET_SHARED
	if test "$HAVEDLOPEN" = yes -a -n "$SHARED"; then
	  AC_MSG_RESULT(yes)
	  AC_DEFINE(USE_MODULES, [Enable use of dynamically loadable modules?])
          NOMODS="#"
	  DEFAULT="module"
	else
	  AC_MSG_RESULT(can't)
	  DC_NO_MODULE
	fi
  ])
])

AC_DEFUN(DC_DO_TYPE, [
	if test -z "$ac_cv_sizeof_long"; then
		AC_C_INLINE
		AC_CHECK_SIZEOF(long, 4)
		AC_CHECK_SIZEOF(int, 4)
		AC_CHECK_SIZEOF(short, 2)
	fi
	FOUND=0
	for dc_cv_loop in \$ac_cv_sizeof_int \$ac_cv_sizeof_long \$ac_cv_sizeof_short; do
		dc_cv_size=`eval echo $dc_cv_loop`
		dc_cv_name=`echo $dc_cv_loop | sed s/\\\$ac_cv_sizeof_//`
		if test "$dc_cv_size" = "$3"; then
			if test "$dc_cv_name" = "int"; then 
				AC_CHECK_TYPE($1, $2 int)
			fi
			if test "$dc_cv_name" = "long"; then
				AC_CHECK_TYPE($1, $2 long)
			fi
			if test "$dc_cv_name" = "short"; then
				AC_CHECK_TYPE($1, $2 short)
			fi
			FOUND=1
			break
		fi
	done
])

AC_DEFUN(DC_CHK_DLOPEN, [
	AC_CHECK_FUNC(dlopen, [
		AC_DEFINE(HAVE_DLOPEN, [1], [Have dlopen()?])
		HAVEDLOPEN=yes
	])
	if test "$ac_cv_func_dlopen" = "no"; then
		AC_CHECK_LIB(dl, dlopen, [
			AC_DEFINE(HAVE_DLOPEN, [1], [Have dlopen()?])
			ALLMODLIBS=-ldl
			AC_SUBST(ALLMODLIBS)
			HAVEDLOPEN=yes
		])
	fi
])

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org 
 */

#ifndef _ALGORITHMS_H
#define _ALOGIRTHMS_H
/*
	Algorithms!
*/

#include "dact.h"
#include "comp_plain.h"
#include "comp_rle.h"
#include "comp_delta.h"
#ifdef HAVE_LIBZ
#include "comp_zlib.h"
#include "comp_mzlib.h"
#include "comp_mzlib2.h"
#endif
#ifdef HAVE_LIBBZ2
#include "comp_bzlib.h"
#endif
#ifdef DEBUG
#include "comp_factor.h"
#include "comp_bitsums.h"
#include "comp_textrle.h"
#endif
#include "comp_snibble.h"
#include "comp_text.h"
#include "comp_fail.h"
#include "comp_lzoox.h"
#include "comp_lzooy.h"
#include "comp_lzota.h"

#ifdef __DACT_C
int (*(algorithms[256]))()={    comp_plain_algo,
                                comp_rle_algo,
                                comp_delta_algo,
				comp_text_algo,
#ifdef HAVE_LIBZ
				comp_zlib_algo,
				comp_mzlib_algo,
#else
				DACT_FAILED_ALGO,
				DACT_FAILED_ALGO,
#endif
				comp_snibble_algo,
				DACT_FAILED_ALGO,
#ifdef HAVE_LIBZ
				comp_mzlib2_algo,
#else
				DACT_FAILED_ALGO,
#endif
#ifdef HAVE_LIBBZ2
				comp_bzlib_algo,
#else
				DACT_FAILED_ALGO,
#endif
#ifdef DEBUG
				comp_factor_algo,
				comp_bitsums_algo,
				comp_textrle_algo,
#else
				DACT_FAILED_ALGO,
				DACT_FAILED_ALGO,
				DACT_FAILED_ALGO,
#endif
				comp_lzoox_algo,
				comp_lzooy_algo,
				comp_lzota_algo,
				NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, NULL, NULL, NULL, NULL, NULL, NULL,
				NULL, NULL, 
                                NULL};

char *algorithm_names[256]={	"Uncompressed",
				"RLE Compression",
				"Delta Compression",
				"Text Compression",
#ifdef HAVE_LIBZ
				"Zlib Compression",
				"Modified Zlib Compression",
#else
				"Unsupported Algorithm (zlib)",
				"Unsupported Algorithm (mzlib)",
#endif
				"Seminibble Encoding",
				"Range Encoding",
#ifdef HAVE_LIBZ
				"Second Modified Zlib Compression",
#else
				"Unsupported Algorithm (mzlib2)",
#endif
#ifdef HAVE_LIBBZ2
				"Bzip2 Compression",
#else
				"Unsupported Algorithm (bzlib)",
#endif
#ifdef DEBUG
				"Factor Compression",
				"Bitsums Compression",
				"Text RLE Compression",
#else
				"Unsupported Algorithm (factor)",
				"Unsupported Algorithm (bitsums)",
				"Unsupported Algorithm (textrle)",
#endif
#ifdef HAVE_LIBLZO
				"LZO-1x Compression",
				"LZO-1y Compression",
				"LZO-2a Compression",
#else
				"Unsupported Algorithm (comp_lzoox)",
				"Unsupported Algorithm (comp_lzooy)",
				"Unsupported Algorithm (comp_lzota)",
#endif
				NULL
			};
#else
extern int (*(algorithms[256]))();
extern char *algorithm_names[256];
#endif
#endif

# This file was generated by Autom4te Mon Jan 19 17:15:15 PST 2004.
# It contains the lists of macros which have been traced.
# It can be safely removed.

@request = (
             bless( [
                      '0',
                      1,
                      [
                        '/usr/share/autoconf'
                      ],
                      [
                        '/usr/share/autoconf/autoconf/autoconf.m4f',
                        'aclocal.m4',
                        'configure.in'
                      ],
                      {
                        'm4_pattern_forbid' => 1,
                        'AC_CONFIG_LIBOBJ_DIR' => 1,
                        'AC_C_VOLATILE' => 1,
                        'AC_TYPE_OFF_T' => 1,
                        'AC_FUNC_CLOSEDIR_VOID' => 1,
                        'AC_REPLACE_FNMATCH' => 1,
                        'AC_PROG_LIBTOOL' => 1,
                        'AC_FUNC_STAT' => 1,
                        'AC_FUNC_WAIT3' => 1,
                        'AC_HEADER_TIME' => 1,
                        'AC_FUNC_LSTAT' => 1,
                        'AC_STRUCT_TM' => 1,
                        'AM_AUTOMAKE_VERSION' => 1,
                        'AC_FUNC_GETMNTENT' => 1,
                        'AC_TYPE_MODE_T' => 1,
                        'AC_FUNC_STRTOD' => 1,
                        'AC_CHECK_HEADERS' => 1,
                        'AC_FUNC_STRNLEN' => 1,
                        'm4_sinclude' => 1,
                        'AC_PROG_CXX' => 1,
                        'AC_PATH_X' => 1,
                        'AC_FUNC_LSTAT_FOLLOWS_SLASHED_SYMLINK' => 1,
                        'AC_PROG_AWK' => 1,
                        '_m4_warn' => 1,
                        'AC_HEADER_STDC' => 1,
                        'AC_HEADER_MAJOR' => 1,
                        'AC_FUNC_ERROR_AT_LINE' => 1,
                        'AC_PROG_GCC_TRADITIONAL' => 1,
                        'AC_LIBSOURCE' => 1,
                        'AC_FUNC_MBRTOWC' => 1,
                        'AC_STRUCT_ST_BLOCKS' => 1,
                        'AC_TYPE_SIGNAL' => 1,
                        'AC_TYPE_UID_T' => 1,
                        'AC_PROG_MAKE_SET' => 1,
                        'AC_CONFIG_AUX_DIR' => 1,
                        'm4_pattern_allow' => 1,
                        'sinclude' => 1,
                        'AC_DEFINE_TRACE_LITERAL' => 1,
                        'AC_FUNC_STRERROR_R' => 1,
                        'AC_PROG_CC' => 1,
                        'AC_DECL_SYS_SIGLIST' => 1,
                        'AC_FUNC_FORK' => 1,
                        'AC_FUNC_STRCOLL' => 1,
                        'AC_FUNC_VPRINTF' => 1,
                        'AC_PROG_YACC' => 1,
                        'AC_INIT' => 1,
                        'AC_STRUCT_TIMEZONE' => 1,
                        'AC_FUNC_CHOWN' => 1,
                        'AC_SUBST' => 1,
                        'AC_FUNC_ALLOCA' => 1,
                        'AC_CANONICAL_HOST' => 1,
                        'AC_FUNC_GETPGRP' => 1,
                        'AC_PROG_RANLIB' => 1,
                        'AM_INIT_AUTOMAKE' => 1,
                        'AC_FUNC_SETPGRP' => 1,
                        'AC_CONFIG_SUBDIRS' => 1,
                        'AC_FUNC_MMAP' => 1,
                        'AC_FUNC_REALLOC' => 1,
                        'AC_TYPE_SIZE_T' => 1,
                        'AC_CONFIG_LINKS' => 1,
                        'AC_CHECK_TYPES' => 1,
                        'AC_CHECK_MEMBERS' => 1,
                        'AM_MAINTAINER_MODE' => 1,
                        'AC_FUNC_UTIME_NULL' => 1,
                        'AC_FUNC_SELECT_ARGTYPES' => 1,
                        'AC_HEADER_STAT' => 1,
                        'AC_FUNC_STRFTIME' => 1,
                        'AC_PROG_CPP' => 1,
                        'AC_C_INLINE' => 1,
                        'AC_PROG_LEX' => 1,
                        'AC_C_CONST' => 1,
                        'AC_TYPE_PID_T' => 1,
                        'AC_CONFIG_FILES' => 1,
                        'include' => 1,
                        'AC_FUNC_SETVBUF_REVERSED' => 1,
                        'AC_PROG_INSTALL' => 1,
                        'AM_GNU_GETTEXT' => 1,
                        'AC_CHECK_LIB' => 1,
                        'AC_FUNC_OBSTACK' => 1,
                        'AC_FUNC_MALLOC' => 1,
                        'AC_FUNC_GETGROUPS' => 1,
                        'AC_FUNC_GETLOADAVG' => 1,
                        'AH_OUTPUT' => 1,
                        'AC_FUNC_FSEEKO' => 1,
                        'AM_PROG_CC_C_O' => 1,
                        'AC_FUNC_MKTIME' => 1,
                        'AC_CANONICAL_SYSTEM' => 1,
                        'AM_CONDITIONAL' => 1,
                        'AC_CONFIG_HEADERS' => 1,
                        'AC_HEADER_SYS_WAIT' => 1,
                        'AC_PROG_LN_S' => 1,
                        'AC_FUNC_MEMCMP' => 1,
                        'm4_include' => 1,
                        'AC_HEADER_DIRENT' => 1,
                        'AC_CHECK_FUNCS' => 1
                      }
                    ], 'Autom4te::Request' )
           );

m4trace:configure.in:3: -1- AC_INIT
m4trace:configure.in:3: -1- m4_pattern_forbid([^_?A[CHUM]_])
m4trace:configure.in:3: -1- m4_pattern_forbid([_AC_])
m4trace:configure.in:3: -1- m4_pattern_forbid([^LIBOBJS$], [do not use LIBOBJS directly, use AC_LIBOBJ (see section `AC_LIBOBJ vs LIBOBJS'])
m4trace:configure.in:3: -1- m4_pattern_allow([^AS_FLAGS$])
m4trace:configure.in:3: -1- m4_pattern_forbid([^_?m4_])
m4trace:configure.in:3: -1- m4_pattern_forbid([^dnl$])
m4trace:configure.in:3: -1- m4_pattern_forbid([^_?AS_])
m4trace:configure.in:3: -1- AC_SUBST([SHELL], [${CONFIG_SHELL-/bin/sh}])
m4trace:configure.in:3: -1- AC_SUBST([PATH_SEPARATOR])
m4trace:configure.in:3: -1- AC_SUBST([PACKAGE_NAME], [m4_ifdef([AC_PACKAGE_NAME],      ['AC_PACKAGE_NAME'])])
m4trace:configure.in:3: -1- AC_SUBST([PACKAGE_TARNAME], [m4_ifdef([AC_PACKAGE_TARNAME],   ['AC_PACKAGE_TARNAME'])])
m4trace:configure.in:3: -1- AC_SUBST([PACKAGE_VERSION], [m4_ifdef([AC_PACKAGE_VERSION],   ['AC_PACKAGE_VERSION'])])
m4trace:configure.in:3: -1- AC_SUBST([PACKAGE_STRING], [m4_ifdef([AC_PACKAGE_STRING],    ['AC_PACKAGE_STRING'])])
m4trace:configure.in:3: -1- AC_SUBST([PACKAGE_BUGREPORT], [m4_ifdef([AC_PACKAGE_BUGREPORT], ['AC_PACKAGE_BUGREPORT'])])
m4trace:configure.in:3: -1- AC_SUBST([exec_prefix], [NONE])
m4trace:configure.in:3: -1- AC_SUBST([prefix], [NONE])
m4trace:configure.in:3: -1- AC_SUBST([program_transform_name], [s,x,x,])
m4trace:configure.in:3: -1- AC_SUBST([bindir], ['${exec_prefix}/bin'])
m4trace:configure.in:3: -1- AC_SUBST([sbindir], ['${exec_prefix}/sbin'])
m4trace:configure.in:3: -1- AC_SUBST([libexecdir], ['${exec_prefix}/libexec'])
m4trace:configure.in:3: -1- AC_SUBST([datadir], ['${prefix}/share'])
m4trace:configure.in:3: -1- AC_SUBST([sysconfdir], ['${prefix}/etc'])
m4trace:configure.in:3: -1- AC_SUBST([sharedstatedir], ['${prefix}/com'])
m4trace:configure.in:3: -1- AC_SUBST([localstatedir], ['${prefix}/var'])
m4trace:configure.in:3: -1- AC_SUBST([libdir], ['${exec_prefix}/lib'])
m4trace:configure.in:3: -1- AC_SUBST([includedir], ['${prefix}/include'])
m4trace:configure.in:3: -1- AC_SUBST([oldincludedir], ['/usr/include'])
m4trace:configure.in:3: -1- AC_SUBST([infodir], ['${prefix}/info'])
m4trace:configure.in:3: -1- AC_SUBST([mandir], ['${prefix}/man'])
m4trace:configure.in:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_NAME])
m4trace:configure.in:3: -1- AH_OUTPUT([PACKAGE_NAME], [/* Define to the full name of this package. */
#undef PACKAGE_NAME])
m4trace:configure.in:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_TARNAME])
m4trace:configure.in:3: -1- AH_OUTPUT([PACKAGE_TARNAME], [/* Define to the one symbol short name of this package. */
#undef PACKAGE_TARNAME])
m4trace:configure.in:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_VERSION])
m4trace:configure.in:3: -1- AH_OUTPUT([PACKAGE_VERSION], [/* Define to the version of this package. */
#undef PACKAGE_VERSION])
m4trace:configure.in:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_STRING])
m4trace:configure.in:3: -1- AH_OUTPUT([PACKAGE_STRING], [/* Define to the full name and version of this package. */
#undef PACKAGE_STRING])
m4trace:configure.in:3: -1- AC_DEFINE_TRACE_LITERAL([PACKAGE_BUGREPORT])
m4trace:configure.in:3: -1- AH_OUTPUT([PACKAGE_BUGREPORT], [/* Define to the address where bug reports for this package should be sent. */
#undef PACKAGE_BUGREPORT])
m4trace:configure.in:3: -1- AC_SUBST([build_alias])
m4trace:configure.in:3: -1- AC_SUBST([host_alias])
m4trace:configure.in:3: -1- AC_SUBST([target_alias])
m4trace:configure.in:3: -1- AC_SUBST([DEFS])
m4trace:configure.in:3: -1- AC_SUBST([ECHO_C])
m4trace:configure.in:3: -1- AC_SUBST([ECHO_N])
m4trace:configure.in:3: -1- AC_SUBST([ECHO_T])
m4trace:configure.in:3: -1- AC_SUBST([LIBS])
m4trace:configure.in:4: -1- AC_CONFIG_HEADERS([config.h])
m4trace:configure.in:7: -1- AC_PROG_CC
m4trace:configure.in:7: -1- AC_SUBST([CC])
m4trace:configure.in:7: -1- AC_SUBST([CFLAGS])
m4trace:configure.in:7: -1- AC_SUBST([LDFLAGS])
m4trace:configure.in:7: -1- AC_SUBST([CPPFLAGS])
m4trace:configure.in:7: -1- AC_SUBST([CC])
m4trace:configure.in:7: -1- AC_SUBST([ac_ct_CC])
m4trace:configure.in:7: -1- AC_SUBST([CC])
m4trace:configure.in:7: -1- AC_SUBST([ac_ct_CC])
m4trace:configure.in:7: -1- AC_SUBST([CC])
m4trace:configure.in:7: -1- AC_SUBST([CC])
m4trace:configure.in:7: -1- AC_SUBST([ac_ct_CC])
m4trace:configure.in:7: -1- AC_SUBST([EXEEXT], [$ac_cv_exeext])
m4trace:configure.in:7: -1- AC_SUBST([OBJEXT], [$ac_cv_objext])
m4trace:configure.in:8: -1- AC_PROG_MAKE_SET
m4trace:configure.in:8: -1- AC_SUBST([SET_MAKE])
m4trace:configure.in:9: -1- AC_PROG_INSTALL
m4trace:configure.in:9: -1- AC_SUBST([INSTALL_PROGRAM])
m4trace:configure.in:9: -1- AC_SUBST([INSTALL_SCRIPT])
m4trace:configure.in:9: -1- AC_SUBST([INSTALL_DATA])
m4trace:configure.in:11: -1- AC_SUBST([DEPEND])
m4trace:configure.in:15: -1- AC_DEFINE_TRACE_LITERAL([HAVE_DLOPEN])
m4trace:configure.in:15: -1- AH_OUTPUT([HAVE_DLOPEN], [/* Have dlopen()? */
#undef HAVE_DLOPEN])
m4trace:configure.in:15: -1- AC_CHECK_LIB([dl], [dlopen], [
			AC_DEFINE(HAVE_DLOPEN, [1], [Have dlopen()?])
			ALLMODLIBS=-ldl
			AC_SUBST(ALLMODLIBS)
			HAVEDLOPEN=yes
		])
m4trace:configure.in:15: -1- AC_DEFINE_TRACE_LITERAL([HAVE_DLOPEN])
m4trace:configure.in:15: -1- AH_OUTPUT([HAVE_DLOPEN], [/* Have dlopen()? */
#undef HAVE_DLOPEN])
m4trace:configure.in:15: -1- AC_SUBST([ALLMODLIBS])
m4trace:configure.in:16: -1- AC_SUBST([ALGO])
m4trace:configure.in:16: -1- AC_SUBST([MODLIBS])
m4trace:configure.in:16: -1- AC_CHECK_LIB([z], [main], [
    ALGO="comp_zlib.c comp_mzlib.c comp_mzlib2.c $ALGO"
    MODLIBS="-lz $MODLIBS"
    AC_DEFINE(HAVE_LIBZ, [], [Something])
  ])
m4trace:configure.in:16: -1- AC_DEFINE_TRACE_LITERAL([HAVE_LIBZ])
m4trace:configure.in:16: -1- AH_OUTPUT([HAVE_LIBZ], [/* Something */
#undef HAVE_LIBZ])
m4trace:configure.in:17: -1- AC_SUBST([ALGO])
m4trace:configure.in:17: -1- AC_SUBST([MODLIBS])
m4trace:configure.in:17: -1- AC_CHECK_LIB([bz2], [main], [
    ALGO="comp_bzlib.c $ALGO"
    MODLIBS="-lbz2 $MODLIBS"
    AC_DEFINE(HAVE_LIBBZ2, [], [Something])
  ])
m4trace:configure.in:17: -1- AC_DEFINE_TRACE_LITERAL([HAVE_LIBBZ2])
m4trace:configure.in:17: -1- AH_OUTPUT([HAVE_LIBBZ2], [/* Something */
#undef HAVE_LIBBZ2])
m4trace:configure.in:18: -1- AC_SUBST([ALGO])
m4trace:configure.in:18: -1- AC_SUBST([MODLIBS])
m4trace:configure.in:18: -1- AC_CHECK_LIB([mcrypt], [main], [
    ALGO="cipher_serpent.c $ALGO"
    MODLIBS="-lmcrypt $MODLIBS"
    AC_DEFINE(HAVE_LIBMCRYPT, [], [Something])
  ])
m4trace:configure.in:18: -1- AC_DEFINE_TRACE_LITERAL([HAVE_LIBMCRYPT])
m4trace:configure.in:18: -1- AH_OUTPUT([HAVE_LIBMCRYPT], [/* Something */
#undef HAVE_LIBMCRYPT])
m4trace:configure.in:19: -1- AC_SUBST([ALGO])
m4trace:configure.in:19: -1- AC_SUBST([MODLIBSCOND])
m4trace:configure.in:19: -1- AC_CHECK_LIB([lzo], [main], [
    ALGO="comp_lzoox.c comp_lzooy.c comp_lzota.c $ALGO"
    MODLIBSCOND="-llzo $(eval echo $(echo \$MODLIBSCOND))"
    AC_DEFINE(HAVE_LIBLZO, [], [Also something])
  ])
m4trace:configure.in:19: -1- AC_DEFINE_TRACE_LITERAL([HAVE_LIBLZO])
m4trace:configure.in:19: -1- AH_OUTPUT([HAVE_LIBLZO], [/* Also something */
#undef HAVE_LIBLZO])
m4trace:configure.in:21: -2- AC_DEFINE_TRACE_LITERAL([CHECK_VERSION])
m4trace:configure.in:21: -2- AH_OUTPUT([CHECK_VERSION], [/* Check for new versions over the network? */
#undef CHECK_VERSION])
m4trace:configure.in:21: -1- AC_DEFINE_TRACE_LITERAL([CHECK_VERSION])
m4trace:configure.in:21: -1- AH_OUTPUT([CHECK_VERSION], [/* Check for new versions over the network? */
#undef CHECK_VERSION])
m4trace:configure.in:22: -3- AC_DEFINE_TRACE_LITERAL([HAVE_INET_ATON])
m4trace:configure.in:22: -3- AH_OUTPUT([HAVE_INET_ATON], [/* Have inet_aton() ? */
#undef HAVE_INET_ATON])
m4trace:configure.in:22: -1- AC_DEFINE_TRACE_LITERAL([NO_NETWORK])
m4trace:configure.in:22: -1- AH_OUTPUT([NO_NETWORK], [/* Disable all network support */
#undef NO_NETWORK])
m4trace:configure.in:22: -2- AC_DEFINE_TRACE_LITERAL([HAVE_INET_ATON])
m4trace:configure.in:22: -2- AH_OUTPUT([HAVE_INET_ATON], [/* Have inet_aton() ? */
#undef HAVE_INET_ATON])
m4trace:configure.in:23: -1- AC_DEFINE_TRACE_LITERAL([DEBUG])
m4trace:configure.in:23: -1- AH_OUTPUT([DEBUG], [/* Debug */
#undef DEBUG])
m4trace:configure.in:23: -1- AC_DEFINE_TRACE_LITERAL([DEBUG])
m4trace:configure.in:23: -1- AH_OUTPUT([DEBUG], [/* Debug */
#undef DEBUG])
m4trace:configure.in:24: -1- AC_SUBST([DEFAULT])
m4trace:configure.in:24: -1- AC_SUBST([MODS])
m4trace:configure.in:24: -1- AC_SUBST([NOMODS])
m4trace:configure.in:24: -1- AC_DEFINE_TRACE_LITERAL([HAVE_DLOPEN])
m4trace:configure.in:24: -1- AH_OUTPUT([HAVE_DLOPEN], [/* Have dlopen()? */
#undef HAVE_DLOPEN])
m4trace:configure.in:24: -1- AC_CHECK_LIB([dl], [dlopen], [
			AC_DEFINE(HAVE_DLOPEN, [1], [Have dlopen()?])
			ALLMODLIBS=-ldl
			AC_SUBST(ALLMODLIBS)
			HAVEDLOPEN=yes
		])
m4trace:configure.in:24: -1- AC_DEFINE_TRACE_LITERAL([HAVE_DLOPEN])
m4trace:configure.in:24: -1- AH_OUTPUT([HAVE_DLOPEN], [/* Have dlopen()? */
#undef HAVE_DLOPEN])
m4trace:configure.in:24: -1- AC_SUBST([ALLMODLIBS])
m4trace:configure.in:24: -1- AC_SUBST([SHARED])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- AC_DEFINE_TRACE_LITERAL([USE_MODULES])
m4trace:configure.in:24: -1- AH_OUTPUT([USE_MODULES], [/* Enable use of dynamically loadable modules? */
#undef USE_MODULES])
m4trace:configure.in:24: -1- AC_SUBST([SHARED])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- _m4_warn([obsolete], [The macro `AC_TRY_LINK' is obsolete.
You should run autoupdate.], [autoconf/general.m4:2223: AC_TRY_LINK is expanded from...
aclocal.m4:162: DC_GET_SHARED is expanded from...
autoconf/general.m4:1303: AC_ARG_ENABLE is expanded from...
aclocal.m4:203: DC_ASK_MODULE is expanded from...
configure.in:24: the top level])
m4trace:configure.in:24: -1- AC_DEFINE_TRACE_LITERAL([USE_MODULES])
m4trace:configure.in:25: -1- AC_DEFINE_TRACE_LITERAL([DACT_DEBIAN_UPGRADE_PROC])
m4trace:configure.in:25: -1- AH_OUTPUT([DACT_DEBIAN_UPGRADE_PROC], [/* Use the Debian upgrade procedure instead of DACTs internal one */
#undef DACT_DEBIAN_UPGRADE_PROC])
m4trace:configure.in:26: -1- AC_DEFINE_TRACE_LITERAL([HAVE_DEV_URANDOM])
m4trace:configure.in:26: -1- AH_OUTPUT([HAVE_DEV_URANDOM], [/* Have random device? */
#undef HAVE_DEV_URANDOM])
m4trace:configure.in:29: -1- AC_CHECK_HEADERS([zlib.h getopt.h stdio.h strings.h string.h unistd.h stdint.h inttypes.h bzlib.h sys/utsname.h sys/socket.h sys/wait.h lzoconf.h lzo1x.h lzo1y.h lzo2a.h dirent.h mcrypt.h dlfcn.h])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_ZLIB_H], [/* Define to 1 if you have the <zlib.h> header file. */
#undef HAVE_ZLIB_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_GETOPT_H], [/* Define to 1 if you have the <getopt.h> header file. */
#undef HAVE_GETOPT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STDIO_H], [/* Define to 1 if you have the <stdio.h> header file. */
#undef HAVE_STDIO_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STRINGS_H], [/* Define to 1 if you have the <strings.h> header file. */
#undef HAVE_STRINGS_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STRING_H], [/* Define to 1 if you have the <string.h> header file. */
#undef HAVE_STRING_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_UNISTD_H], [/* Define to 1 if you have the <unistd.h> header file. */
#undef HAVE_UNISTD_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STDINT_H], [/* Define to 1 if you have the <stdint.h> header file. */
#undef HAVE_STDINT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_INTTYPES_H], [/* Define to 1 if you have the <inttypes.h> header file. */
#undef HAVE_INTTYPES_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_BZLIB_H], [/* Define to 1 if you have the <bzlib.h> header file. */
#undef HAVE_BZLIB_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_SYS_UTSNAME_H], [/* Define to 1 if you have the <sys/utsname.h> header file. */
#undef HAVE_SYS_UTSNAME_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_SYS_SOCKET_H], [/* Define to 1 if you have the <sys/socket.h> header file. */
#undef HAVE_SYS_SOCKET_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_SYS_WAIT_H], [/* Define to 1 if you have the <sys/wait.h> header file. */
#undef HAVE_SYS_WAIT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_LZOCONF_H], [/* Define to 1 if you have the <lzoconf.h> header file. */
#undef HAVE_LZOCONF_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_LZO1X_H], [/* Define to 1 if you have the <lzo1x.h> header file. */
#undef HAVE_LZO1X_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_LZO1Y_H], [/* Define to 1 if you have the <lzo1y.h> header file. */
#undef HAVE_LZO1Y_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_LZO2A_H], [/* Define to 1 if you have the <lzo2a.h> header file. */
#undef HAVE_LZO2A_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_DIRENT_H], [/* Define to 1 if you have the <dirent.h> header file. */
#undef HAVE_DIRENT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_MCRYPT_H], [/* Define to 1 if you have the <mcrypt.h> header file. */
#undef HAVE_MCRYPT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_DLFCN_H], [/* Define to 1 if you have the <dlfcn.h> header file. */
#undef HAVE_DLFCN_H])
m4trace:configure.in:29: -1- AC_HEADER_STDC
m4trace:configure.in:29: -1- AC_PROG_CPP
m4trace:configure.in:29: -1- AC_SUBST([CPP])
m4trace:configure.in:29: -1- AC_SUBST([CPPFLAGS])
m4trace:configure.in:29: -1- AC_SUBST([CPP])
m4trace:configure.in:29: -1- AC_SUBST([EGREP])
m4trace:configure.in:29: -1- AC_DEFINE_TRACE_LITERAL([STDC_HEADERS])
m4trace:configure.in:29: -1- AH_OUTPUT([STDC_HEADERS], [/* Define to 1 if you have the ANSI C header files. */
#undef STDC_HEADERS])
m4trace:configure.in:29: -1- AC_CHECK_HEADERS([sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \
		  inttypes.h stdint.h unistd.h], [], [], [$ac_includes_default])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_SYS_TYPES_H], [/* Define to 1 if you have the <sys/types.h> header file. */
#undef HAVE_SYS_TYPES_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_SYS_STAT_H], [/* Define to 1 if you have the <sys/stat.h> header file. */
#undef HAVE_SYS_STAT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STDLIB_H], [/* Define to 1 if you have the <stdlib.h> header file. */
#undef HAVE_STDLIB_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STRING_H], [/* Define to 1 if you have the <string.h> header file. */
#undef HAVE_STRING_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_MEMORY_H], [/* Define to 1 if you have the <memory.h> header file. */
#undef HAVE_MEMORY_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STRINGS_H], [/* Define to 1 if you have the <strings.h> header file. */
#undef HAVE_STRINGS_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_INTTYPES_H], [/* Define to 1 if you have the <inttypes.h> header file. */
#undef HAVE_INTTYPES_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_STDINT_H], [/* Define to 1 if you have the <stdint.h> header file. */
#undef HAVE_STDINT_H])
m4trace:configure.in:29: -1- AH_OUTPUT([HAVE_UNISTD_H], [/* Define to 1 if you have the <unistd.h> header file. */
#undef HAVE_UNISTD_H])
m4trace:configure.in:32: -1- AC_DEFINE_TRACE_LITERAL([uint])
m4trace:configure.in:32: -1- AH_OUTPUT([uint], [/* Define to `unsigned int\' if <sys/types.h> does not define. */
#undef uint])
m4trace:configure.in:37: -1- AC_C_INLINE
m4trace:configure.in:37: -1- AH_OUTPUT([inline], [/* Define to `__inline__\' or `__inline\' if that\'s what the C compiler
   calls it, or to nothing if \'inline\' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif])
m4trace:configure.in:38: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_LONG])
m4trace:configure.in:38: -1- AH_OUTPUT([SIZEOF_LONG], [/* The size of a `long\', as computed by sizeof. */
#undef SIZEOF_LONG])
m4trace:configure.in:39: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_INT])
m4trace:configure.in:39: -1- AH_OUTPUT([SIZEOF_INT], [/* The size of a `int\', as computed by sizeof. */
#undef SIZEOF_INT])
m4trace:configure.in:40: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_SHORT])
m4trace:configure.in:40: -1- AH_OUTPUT([SIZEOF_SHORT], [/* The size of a `short\', as computed by sizeof. */
#undef SIZEOF_SHORT])
m4trace:configure.in:42: -1- AC_C_INLINE
m4trace:configure.in:42: -1- AH_OUTPUT([inline], [/* Define to `__inline__\' or `__inline\' if that\'s what the C compiler
   calls it, or to nothing if \'inline\' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_LONG])
m4trace:configure.in:42: -1- AH_OUTPUT([SIZEOF_LONG], [/* The size of a `long\', as computed by sizeof. */
#undef SIZEOF_LONG])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_INT])
m4trace:configure.in:42: -1- AH_OUTPUT([SIZEOF_INT], [/* The size of a `int\', as computed by sizeof. */
#undef SIZEOF_INT])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_SHORT])
m4trace:configure.in:42: -1- AH_OUTPUT([SIZEOF_SHORT], [/* The size of a `short\', as computed by sizeof. */
#undef SIZEOF_SHORT])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([uint32_t])
m4trace:configure.in:42: -1- AH_OUTPUT([uint32_t], [/* Define to `unsigned int\' if <sys/types.h> does not define. */
#undef uint32_t])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([uint32_t])
m4trace:configure.in:42: -1- AH_OUTPUT([uint32_t], [/* Define to `unsigned long\' if <sys/types.h> does not define. */
#undef uint32_t])
m4trace:configure.in:42: -1- AC_DEFINE_TRACE_LITERAL([uint32_t])
m4trace:configure.in:42: -1- AH_OUTPUT([uint32_t], [/* Define to `unsigned short\' if <sys/types.h> does not define. */
#undef uint32_t])
m4trace:configure.in:43: -1- AC_C_INLINE
m4trace:configure.in:43: -1- AH_OUTPUT([inline], [/* Define to `__inline__\' or `__inline\' if that\'s what the C compiler
   calls it, or to nothing if \'inline\' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_LONG])
m4trace:configure.in:43: -1- AH_OUTPUT([SIZEOF_LONG], [/* The size of a `long\', as computed by sizeof. */
#undef SIZEOF_LONG])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_INT])
m4trace:configure.in:43: -1- AH_OUTPUT([SIZEOF_INT], [/* The size of a `int\', as computed by sizeof. */
#undef SIZEOF_INT])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_SHORT])
m4trace:configure.in:43: -1- AH_OUTPUT([SIZEOF_SHORT], [/* The size of a `short\', as computed by sizeof. */
#undef SIZEOF_SHORT])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([int32_t])
m4trace:configure.in:43: -1- AH_OUTPUT([int32_t], [/* Define to `signed int\' if <sys/types.h> does not define. */
#undef int32_t])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([int32_t])
m4trace:configure.in:43: -1- AH_OUTPUT([int32_t], [/* Define to `signed long\' if <sys/types.h> does not define. */
#undef int32_t])
m4trace:configure.in:43: -1- AC_DEFINE_TRACE_LITERAL([int32_t])
m4trace:configure.in:43: -1- AH_OUTPUT([int32_t], [/* Define to `signed short\' if <sys/types.h> does not define. */
#undef int32_t])
m4trace:configure.in:44: -1- AC_C_INLINE
m4trace:configure.in:44: -1- AH_OUTPUT([inline], [/* Define to `__inline__\' or `__inline\' if that\'s what the C compiler
   calls it, or to nothing if \'inline\' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_LONG])
m4trace:configure.in:44: -1- AH_OUTPUT([SIZEOF_LONG], [/* The size of a `long\', as computed by sizeof. */
#undef SIZEOF_LONG])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_INT])
m4trace:configure.in:44: -1- AH_OUTPUT([SIZEOF_INT], [/* The size of a `int\', as computed by sizeof. */
#undef SIZEOF_INT])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_SHORT])
m4trace:configure.in:44: -1- AH_OUTPUT([SIZEOF_SHORT], [/* The size of a `short\', as computed by sizeof. */
#undef SIZEOF_SHORT])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([uint16_t])
m4trace:configure.in:44: -1- AH_OUTPUT([uint16_t], [/* Define to `unsigned int\' if <sys/types.h> does not define. */
#undef uint16_t])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([uint16_t])
m4trace:configure.in:44: -1- AH_OUTPUT([uint16_t], [/* Define to `unsigned long\' if <sys/types.h> does not define. */
#undef uint16_t])
m4trace:configure.in:44: -1- AC_DEFINE_TRACE_LITERAL([uint16_t])
m4trace:configure.in:44: -1- AH_OUTPUT([uint16_t], [/* Define to `unsigned short\' if <sys/types.h> does not define. */
#undef uint16_t])
m4trace:configure.in:45: -1- AC_C_INLINE
m4trace:configure.in:45: -1- AH_OUTPUT([inline], [/* Define to `__inline__\' or `__inline\' if that\'s what the C compiler
   calls it, or to nothing if \'inline\' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_LONG])
m4trace:configure.in:45: -1- AH_OUTPUT([SIZEOF_LONG], [/* The size of a `long\', as computed by sizeof. */
#undef SIZEOF_LONG])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_INT])
m4trace:configure.in:45: -1- AH_OUTPUT([SIZEOF_INT], [/* The size of a `int\', as computed by sizeof. */
#undef SIZEOF_INT])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([SIZEOF_SHORT])
m4trace:configure.in:45: -1- AH_OUTPUT([SIZEOF_SHORT], [/* The size of a `short\', as computed by sizeof. */
#undef SIZEOF_SHORT])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([int16_t])
m4trace:configure.in:45: -1- AH_OUTPUT([int16_t], [/* Define to `signed int\' if <sys/types.h> does not define. */
#undef int16_t])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([int16_t])
m4trace:configure.in:45: -1- AH_OUTPUT([int16_t], [/* Define to `signed long\' if <sys/types.h> does not define. */
#undef int16_t])
m4trace:configure.in:45: -1- AC_DEFINE_TRACE_LITERAL([int16_t])
m4trace:configure.in:45: -1- AH_OUTPUT([int16_t], [/* Define to `signed short\' if <sys/types.h> does not define. */
#undef int16_t])
m4trace:configure.in:48: -2- AC_DEFINE_TRACE_LITERAL([HAVE_COMPRESS2])
m4trace:configure.in:48: -2- AH_OUTPUT([HAVE_COMPRESS2], [/* Have more versatile compress2() ? */
#undef HAVE_COMPRESS2])
m4trace:configure.in:48: -1- AC_CHECK_LIB([z], [compress2], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_COMPRESS2 
_ACEOF
])
m4trace:configure.in:49: -2- AC_DEFINE_TRACE_LITERAL([HAVE_GZDOPEN])
m4trace:configure.in:49: -2- AH_OUTPUT([HAVE_GZDOPEN], [/* Have gzdopen() ? */
#undef HAVE_GZDOPEN])
m4trace:configure.in:49: -1- AC_CHECK_LIB([z], [gzdopen], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_GZDOPEN 
_ACEOF
])
m4trace:configure.in:50: -2- AC_DEFINE_TRACE_LITERAL([HAVE_OLD_BZ2])
m4trace:configure.in:50: -2- AH_OUTPUT([HAVE_OLD_BZ2], [/* Do not have BZ2_ prefixed to all bzip2 symbols? */
#undef HAVE_OLD_BZ2])
m4trace:configure.in:50: -1- AC_CHECK_LIB([bz2], [bzBuffToBuffCompress], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_OLD_BZ2 
_ACEOF
])
m4trace:configure.in:51: -2- AC_DEFINE_TRACE_LITERAL([HAVE_NEW_BZ2])
m4trace:configure.in:51: -2- AH_OUTPUT([HAVE_NEW_BZ2], [/* Have BZ2_ prefixed to all bzip2 symbols? */
#undef HAVE_NEW_BZ2])
m4trace:configure.in:51: -1- AC_CHECK_LIB([bz2], [BZ2_bzBuffToBuffCompress], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_NEW_BZ2 
_ACEOF
])
m4trace:configure.in:52: -2- AC_DEFINE_TRACE_LITERAL([HAVE_NEW_BZ2])
m4trace:configure.in:52: -2- AH_OUTPUT([HAVE_NEW_BZ2], [/* Have BZ2_ prefixed to all bzip2 symbols? */
#undef HAVE_NEW_BZ2])
m4trace:configure.in:52: -1- AC_CHECK_LIB([bz2], [_BZ2_bzBuffToBuffCompress], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_NEW_BZ2 
_ACEOF
])
m4trace:configure.in:53: -2- AC_DEFINE_TRACE_LITERAL([HAVE_BZDOPEN])
m4trace:configure.in:53: -2- AH_OUTPUT([HAVE_BZDOPEN], [/* Have bzdopen() ? */
#undef HAVE_BZDOPEN])
m4trace:configure.in:53: -1- AC_CHECK_LIB([bz2], [bzdopen], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_BZDOPEN 
_ACEOF
])
m4trace:configure.in:54: -2- AC_DEFINE_TRACE_LITERAL([HAVE_NEW_BZDOPEN])
m4trace:configure.in:54: -2- AH_OUTPUT([HAVE_NEW_BZDOPEN], [/* Have BZ2_bzdopen() ? */
#undef HAVE_NEW_BZDOPEN])
m4trace:configure.in:54: -1- AC_CHECK_LIB([bz2], [BZ2_bzdopen], [
cat >>confdefs.h <<\_ACEOF
@%:@define HAVE_NEW_BZDOPEN 
_ACEOF
])
m4trace:configure.in:55: -1- AC_LIBSOURCE([getopt.c])
m4trace:configure.in:55: -1- AC_LIBSOURCE([strsep.c])
m4trace:configure.in:55: -1- AC_LIBSOURCE([getpass.c])
m4trace:configure.in:55: -1- AC_LIBSOURCE([mkstemp.c])
m4trace:configure.in:55: -1- AC_CHECK_FUNCS([getopt strsep getpass mkstemp], [], [_AC_LIBOBJ($ac_func)])
m4trace:configure.in:55: -1- AH_OUTPUT([HAVE_GETOPT], [/* Define to 1 if you have the `getopt\' function. */
#undef HAVE_GETOPT])
m4trace:configure.in:55: -1- AH_OUTPUT([HAVE_STRSEP], [/* Define to 1 if you have the `strsep\' function. */
#undef HAVE_STRSEP])
m4trace:configure.in:55: -1- AH_OUTPUT([HAVE_GETPASS], [/* Define to 1 if you have the `getpass\' function. */
#undef HAVE_GETPASS])
m4trace:configure.in:55: -1- AH_OUTPUT([HAVE_MKSTEMP], [/* Define to 1 if you have the `mkstemp\' function. */
#undef HAVE_MKSTEMP])
m4trace:configure.in:55: -1- AC_SUBST([LIB@&t@OBJS])
m4trace:configure.in:59: -1- AC_CONFIG_FILES([Makefile])
m4trace:configure.in:59: -1- _m4_warn([obsolete], [AC_OUTPUT should be used without arguments.
You should run autoupdate.], [])
m4trace:configure.in:59: -1- AC_SUBST([LIB@&t@OBJS], [$ac_libobjs])
m4trace:configure.in:59: -1- AC_SUBST([LTLIBOBJS], [$ac_ltlibobjs])

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "buffer.h"
#include <stdio.h>
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif

uint32_t bit_buffer_data=0;
int bit_buffer_location=0;

char *byte_buffer_data=NULL;
int byte_buffer_location=-1;


/*
    Func: bit_buffer_read
    Args: 
           bits		- (int) Number of bits to read from the buffer.
    Rets: Int, value from buffer.
    Meth: Bread high BITS bits from BUFFER_DATA and shift to the left.
    Stat: Complete

*/
int bit_buffer_read(int bits) {
        int retval;
        if (bits>bit_buffer_location) { 
		DPRINTF("Request for %i bits, buffer contains %i bits",bits,bit_buffer_location);
		bits=bit_buffer_location;
	}

        retval=(bit_buffer_data>>((sizeof(bit_buffer_data)*8)-bits));
        bit_buffer_data=(bit_buffer_data<<bits);
	bit_buffer_location-=bits;
#ifdef BUFFER_VERBOSE
	DPRINTF("bit_buffer_read(%i)=%i",bits,retval);
#endif
        return(retval);
}

/*
    Func: bit_buffer_write
    Args:
           val		- (uint) Value to write
           bits		- (uint) Number of bits to allocate
    Rets: Nothing
    Meth: Add to right of current BUFFER_DATA[BUFFER_LOCATION], incremint
            BUFFER_LOCATION
    Stat: Complete
*/
void bit_buffer_write(unsigned int val, unsigned int bits) {
        while ((val>>bits)!=0) {
                DPRINTF("Value (%i) is bigger than %i bits.",val,bits);
		bits++;
        }

        if ((bits+bit_buffer_location)>(sizeof(bit_buffer_data)*8)) {
                DPRINTF("Buffer overflow");
                return;
        }
        bit_buffer_location+=bits;
        bit_buffer_data+=(val<<((sizeof(bit_buffer_data)*8)-bit_buffer_location));
#ifdef BUFFER_VERBOSE
	DPRINTF("bit_buffer_write(%i, %i)",val,bits);
#endif
        return;
}


/*
    Func: bit_buffer_size
    Args: None
    Rets: Int, number of bits in buffer
    Meth: buffer_location
    Stat: Complete
*/
int bit_buffer_size(void) {
#ifdef BUFFER_VERBOSE
	DPRINTF("bit_buffer_size()=%i",bit_buffer_location);
#endif
        return(bit_buffer_location);
}


/*
    Func: bit_buffer_purge
    Args: None
    Rets: Nothing
    Meth: Clear BUFFER_DATA and set BUFFER_LOCATION to 0
*/
void bit_buffer_purge(void) {
        bit_buffer_location=0;
        bit_buffer_data=0;
#ifdef BUFFER_VERBOSE
	DPRINTF("bit_buffer_purge()");
#endif
        return;
}


char *byte_buffer_read(int bytes) {
	char *retval;
	if (byte_buffer_location==-1) return(NULL);
	if (bytes>byte_buffer_location) {
		DPRINTF("Request for %i bytes, buffer contains %i bytes.",bytes,byte_buffer_location);
		bytes=byte_buffer_location;
	}
	if (!(retval=malloc(bytes))) {
		memcpy(retval,byte_buffer_data,bytes);
		memmove(byte_buffer_data,byte_buffer_data+bytes,(byte_buffer_location-=bytes));
		return(retval);
	} else {
		return(NULL);
	}
}

void byte_buffer_write(char *val, unsigned int size) {
	if (byte_buffer_location==-1) {
		byte_buffer_purge();
	}
	if ((byte_buffer_location+size)>(BYTE_BUFF_SIZE)) {
		DPRINTF("Buffer overflow.");
		return;
	}
	memcpy(byte_buffer_data+byte_buffer_location,val,size);
	byte_buffer_location+=size;
}

char byte_buffer_read_1(void) {
	char *buffread;
	char retval;
	buffread=byte_buffer_read(1);
	retval=buffread[0];
	free(buffread);
	return(retval);
}

int byte_buffer_size(void) {
	return(byte_buffer_location);
}

void byte_buffer_purge(void) {
	int i;

#if 0
	if (byte_buffer_data!=NULL) free(byte_buffer_data);
	byte_buffer_data=calloc(BYTE_BUFF_SIZE, 1);
#endif
	if (byte_buffer_data==NULL) {
		if (!(byte_buffer_data=malloc(BYTE_BUFF_SIZE))) return;
	}
	if (byte_buffer_location==-1) {
		for (i=0;i<(BYTE_BUFF_SIZE);i++) byte_buffer_data[i]=0;
	} else {
		for (i=0;i<(byte_buffer_location+1);i++) byte_buffer_data[i]=0;
	}
	byte_buffer_location=0;
	return;
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#ifndef _BUFFER_H
#define _BUFFER_H
#include "dact.h"

int bit_buffer_read(int bits);
void bit_buffer_write(unsigned int val, unsigned int bits);
int bit_buffer_size(void);
void bit_buffer_purge(void);

char *byte_buffer_read(int bytes);
char byte_buffer_read_1(void);
void byte_buffer_write(char *val, unsigned int size);
int byte_buffer_size(void);
void byte_buffer_purge(void);

#ifndef BYTE_BUFF_SIZE
#define BYTE_BUFF_SIZE DACT_BLK_SIZE*2
#endif
#endif

#! /bin/sh

if [ ! -x configure ]; then cd ../; fi
CFLAGS='-Iwork/include'
CPPFLAGS="${CFLAGS}"
LDFLAGS='-Lwork/lib'
export CFLAGS LDFLAGS CPPFLAGS
./configure --host=i586-mingw32msvc

#!/bin/bash

if [ ! "${SNAPSHOT}" = "1" ]; then
	VER_MAJ=`echo $VERS | cut -f 1 -d .`
	VER_MIN=`echo $VERS | cut -f 2 -d .`
	VER_REV=`echo $VERS | cut -f 3 -d .`
	printf "%03i%03i%03i\n" $VER_MAJ $VER_MIN $VER_REV > VERSION
else
	echo "SNAPSHOT" > VERSION
fi

rm -f makearch.sh .* *.dct *.bak *.swp *.exe makesnapshot.sh *.o joe* bob* f 2>/dev/null >/dev/null
for i in *.[ch]; do
        grep -v -e '^//' -e DPRINTF -e SHOWVAL $i > f
        mv f $i
done

# This is the name of the utility, it will be prefixed to the tarball name
UTIL="dact"

# This is the name of output files that should exist after configure 
# procedures.
BINS="dact"

# This lists the name of files that are required to exist
REQS=""

# Version of utility, if empty it will be guessed.
# VERS=""

# Space sperated list of documents, if they exist, they will be
# prefixed with the contents of the DOC_HDR file and substitution
# will occur:
#     @@UTIL@@ becomes the utility name ${UTIL}
#     @@VERS@@ becomes the utility version
#     @@DATE@@ becomes the current date
DOCS="AUTHORS README TODO INSTALL ChangeLog TODO.ideas Docs/config_help.txt Docs/dact.txt Docs/INSTALL"
DOC_HDR="HEADER"

# This script is executed immediately prior to creation of the
# tarball
AFTER=""
BEFORE="build/cleanup"

# Files matching these (space-seperated) patterns are deleted
TMPS="*.out bob joe sally f *.exe build work *.dct autom4te.cache HEADER"

#!/bin/sh

cd /home/rkeene/devel/compression/

VER=`/usr/bin/grep "DACT_VER_" dact.h | /bin/cut -f 3 -d " " | /usr/bin/tr "\n" . | /bin/cut -f 1-3 -d "."`
DIRECT=`pwd`
cd ../
echo "Making archive `pwd`/dact-$VER.tar.gz"
cd $DIRECT

VER_MAJ=`echo $VER | cut -f 1 -d .`
VER_MIN=`echo $VER | cut -f 2 -d .`
VER_REV=`echo $VER | cut -f 3 -d .`

mkdir -p ../dact-$VER/Docs
cp * ../dact-$VER 2>/dev/null >/dev/null
cp Docs/* ../dact-$VER/Docs/ 2>/dev/null >/dev/null
cd ../dact-$VER

rm -f makearch.sh .* *.dct *.bak *.swp *.exe makesnapshot.sh *.o joe* bob* f 2>/dev/null >/dev/null

for i in *.[ch]; do 
	grep -v ^// $i > f
	mv f $i
done

./configure 2>&1 >/dev/null
/usr/bin/make distclean >/dev/null 2>/dev/null
/usr/bin/make Makefile.dep 2>/dev/null >/dev/null
/usr/bin/sed s/"DACT_VERSION"/$VER/g README > f
/bin/mv f README
/usr/bin/md5sum * 2>/dev/null > MD5SUM
/usr/bin/file * 2>/dev/null > FILETYPE
printf "%03i%03i%03i\n" $VER_MAJ $VER_MIN $VER_REV > VERSION
cd ..
/bin/tar -zhcf dact-$VER.tar.gz dact-$VER/*
/bin/rm -rf dact-$VER

#!/bin/bash

cd /home/rkeene/devel/compression

VER=`/usr/bin/grep "DACT_VER_" dact.h | /bin/cut -f 3 -d " " | /usr/bin/tr "\n" . | /bin/cut -f 1-3 -d "."`

./makearch.sh 2>/dev/null >/dev/null

cp ../dact-$VER.tar.gz /web/rkeene/devel/dact-snapshot.tar.gz

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#include "dact.h"
#include <math.h>
#include <stdio.h>
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#include <fcntl.h>
#include "ui.h"
#include "cipher_chaos.h"


#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=0;
uint32_t DC_TYPE=DACT_MOD_TYPE_ENC;
void *DC_ALGO=cipher_chaos;
char *DC_NAME="chaos (MOD)";
#endif


int cipher_chaos(const char *inblock, char *outblock, const int blksize, char *key, const int mode) {
	switch (mode) {
		case (DACT_MODE_CINIT+DACT_MODE_CDEC):
		case (DACT_MODE_CINIT+DACT_MODE_CENC):
		case DACT_MODE_CINIT:
			return(cipher_chaos_init(mode,key));
			break;
		case DACT_MODE_CDEC:
			return(cipher_chaos_encdec(inblock, outblock, blksize, key));
			break;
		case DACT_MODE_CENC:
#ifdef DACT_CIPHER_CHAOS
			return(cipher_chaos_encdec(inblock, outblock, blksize, key));
#else
			dact_ui_status(DACT_UI_LVL_GEN, "The chaos cipher is no longer supported.");
			return(-1);
#endif
			break;
	}
	return(0);
}

int cipher_chaos_init(const int mode, char *key) {
	return(cipher_chaos_init_getkey(mode-DACT_MODE_CINIT,key));
}

int cipher_chaos_init_getkey(const int mode, char *key) {
	strcpy(key,dact_ui_getuserinput("File Identification Number: ", 128, 1));
	return(1);
}

int cipher_chaos_encdec(const char *blk, char *outblk, const int blksize, char *key) {
	double fkey;
	int y=0,i;

	fkey=(double) atoi(key);
	for (i=0;i<blksize;i++) {
		outblk[i]=blk[i]^cipher_chaos_getbyte(&fkey,y);
	}
	return(blksize);
}

unsigned char cipher_chaos_getbyte(double *x, int y) {
	static int i=0;

	NORM(*x);
	FIX(*x);
	BEST(*x,y);
	*x=(double) (R(*x)*(1-*x));
	i++;
SPOTVAR_NUM(y);
	return((unsigned char) y);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _CIPHER_CHAOS_H
#define _CIPHER_CHAOS_H
#include "dact.h"
#include "comp_fail.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define cipher_chaos DACT_FAILED_ALGO
#else


#define R(x) 4*(x)
#define NORM(x) { x+=0.000001; while(x<1) x*=10; while(x>=1) x/=10; }
#define BEST(x,y) { y=((int) ((x)*10000))&0xff; }
#define FIX(x) { x=(((double) ((int) ((x)*100000)))/100000); }

int cipher_chaos(const char *inblock, char *outblock, const int blksize, char *key, const int mode);
int cipher_chaos_init(const int mode, char *key);
int cipher_chaos_init_getkey(const int mode, char *key);
int cipher_chaos_encdec(const char *blk, char *outblk, const int blksize, char *key);
unsigned char cipher_chaos_getbyte(double *x, int y);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

/*
	Encrypt data.
*/
#include "dact.h"
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#include <fcntl.h>
#include <stdio.h>
#include <math.h>
#include "cipher_psub.h"
#include "parse.h"
#include "ui.h"

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=3;
uint32_t DC_TYPE=DACT_MOD_TYPE_ENC;
void *DC_ALGO=cipher_psub;
char *DC_NAME="psubst (MOD)";
#endif


int cipher_psub(const unsigned char *inblock, unsigned char *outblock, const int blksize, unsigned char *key, const int mode) {
	switch (mode) {
		case (DACT_MODE_CINIT+DACT_MODE_CDEC):
		case (DACT_MODE_CINIT+DACT_MODE_CENC):
		case DACT_MODE_CINIT:
			return(cipher_psub_init(mode,key));
			break;
		case DACT_MODE_CDEC:
			return(cipher_psub_decrypt(inblock, outblock, blksize, key));
			break;
		case DACT_MODE_CENC:
			return(cipher_psub_encrypt(inblock, outblock, blksize, key));
			break;
	}
	return(0);
}


int cipher_psub_init(const int mode, unsigned char *key) {
	return(cipher_psub_init_getkey(mode-DACT_MODE_CINIT,key));
}

int cipher_psub_init_getkey(const int mode, unsigned char *key) {
	unsigned char *phrase;
	char *keyreg;

	phrase=dact_ui_getuserinput("Passphrase: ",128,1);

	memcpy(key,keyreg=cipher_psub_generatekey(phrase),257);
	free(keyreg);
	return(257);
}

char *cipher_psub_generatekey(const char *passphrase) {
	char *keybuf, used[256], hbuf[4];
	int i,m,x,loc=0,num;
	double d;

	keybuf=malloc(1024);

	for (i=0;i<256;i++) used[i]=0;

	if (strlen(passphrase)<3) { num=257; } else { num=((259/((int) (strlen(passphrase)/3)))+1); }

	for (m=0;m<strlen(passphrase);m+=3) {
		memcpy(hbuf,passphrase+m,3);
		hbuf[3]='\0';
		d=hash_fourbyte(hbuf, '\0');
		for (i=0;i<num;i++) {
			d=(sin(tan(d))*(255*5));
			x=((abs((int) d)&0x3ff)-255);
			if (x<0 || x>255 || used[x]) { i--; continue; }
			used[x]=1;
			if (loc==0) used[x]=0;
			keybuf[loc++]=x;
			if (loc==257) break;
		}
		if (loc==257) break;
	}
	return(keybuf);
}

int cipher_psub_encrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key) {
	int i,mod;
	static int keyoffset=0;

	mod=(int) key[0];
	for (i=0;i<blksize;i++) {
		if (!(i%mod)) {
			keyoffset=((keyoffset+1)&0xff);
		}
		outblk[i]=key[((((int) inblk[i])+keyoffset)&0xff)+1];
	}
	return(blksize);
}

int cipher_psub_decrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key) {
	int i,mod,x;
	char reversekey[256];
	static int keyoffset=0;

	mod=(int) key[0];
	for (i=1;i<257;i++) reversekey[(int) key[i]]=(i-1);
	for (i=0;i<blksize;i++) {
		if (!(i%mod)) {
			keyoffset=((keyoffset+1)&0xff);
			for (x=0;x<256;x++) reversekey[(int) key[((x+keyoffset)&0xff)+1]]=x;
		}
		outblk[i]=reversekey[(int) inblk[i]];
	}
	return(blksize);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _CIPHER_PSUB_H
#define _CIPHER_PSUB_H
#include "dact.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define cipher_psub DACT_FAILED_ALGO
#else


int cipher_psub(const unsigned char *inblock, unsigned char *outblock, const int blksize, unsigned char *key, const int mode);
int cipher_psub_init(const int mode, unsigned char *key);
int cipher_psub_init_getkey(const int mode, unsigned char *key);
char *cipher_psub_generatekey(const char *passphrase);
int cipher_psub_encrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key);
int cipher_psub_decrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key);
#endif
#endif

/*
	Serpent Cipher from libmcrypt
*/
#include "dact.h"
#include "cipher_serpent.h"
#ifdef HAVE_MCRYPT
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#include <fcntl.h>
#include <stdio.h>
#include <time.h>
#include "parse.h"
#include "ui.h"

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=2;
uint32_t DC_TYPE=DACT_MOD_TYPE_ENC;
void *DC_ALGO=cipher_serpent;
char *DC_NAME="serpent (MOD)";
#endif

MCRYPT mcrypt_tdid;

int cipher_serpent(const char *inblock, char *outblock, const int blksize, char *key, const int mode) {
	static unsigned char *IV;

	switch (mode) {
		case (DACT_MODE_CINIT+DACT_MODE_CDEC):
		case (DACT_MODE_CINIT+DACT_MODE_CENC):
		case DACT_MODE_CINIT:
			return(cipher_serpent_init(mode, key, IV));
			break;
		case DACT_MODE_CDEC:
			return(cipher_serpent_decrypt(inblock, outblock, blksize, key, IV));
			break;
		case DACT_MODE_CENC:
			return(cipher_serpent_encrypt(inblock, outblock, blksize, key, IV));
			break;
	}
	return(0);
}


int cipher_serpent_init(const int mode, char *key, unsigned char *IV) {
	char *password;
	int plen, i;
	unsigned char buff;
	char *mime_buf;
#ifdef RANDOM_DEV
	int fd;
	fd=open(RANDOM_DEV, O_RDONLY);
	if (fd<0) {
#endif
		srand(time(NULL)+rand());
#ifdef RANDOM_DEV
	}
#endif

	mcrypt_tdid=mcrypt_module_open("serpent", NULL, "cfb", NULL);
	if (mcrypt_tdid==MCRYPT_FAILED) {
#ifdef RANDOM_DEV
		if (fd>=0) close(fd);
#endif
		return(-1);
	}

	password=dact_ui_getuserinput("Enter your passphrase: ", 128, 1);
	memset(key, 1, 16);
	plen=strlen(password);
	if (plen<16) plen=16;
	memcpy(key, password, plen);

	if ((mode-DACT_MODE_CINIT)==DACT_MODE_CENC) {
/*	mhash_keygen(KEYGEN_MCRYPT, MHASH_MD5, key, 16, NULL, 0, password, strlen(password)); */
		plen=mcrypt_enc_get_iv_size(mcrypt_tdid);
		IV=malloc(plen);

		for (i=0; i<plen; i++) {
#ifdef RANDOM_DEV
			if (fd>=0) {
				read(fd, &buff, 1);
			} else {
#endif
				srand(time(NULL)+rand());
				buff=(int) ((256.0*rand())/(RAND_MAX+1.0));
#ifdef RANDOM_DEV
			}
#endif
			IV[i]=buff;
		}
		mime_buf=mimes64(IV, &plen);
		fprintf(stderr, "Magic [needed for decryption]:  %s\n", mime_buf);
		free(mime_buf);
	} else {
		plen=mcrypt_enc_get_iv_size(mcrypt_tdid);
		IV=dact_ui_getuserinput("Enter your magic key: ", plen*3, 0);
		mime_buf=demime64(IV);
		memcpy(IV, mime_buf, plen);
		free(mime_buf);
	}


#ifdef RANDOM_DEV
	if (fd>=0) close(fd);
#endif

	i=mcrypt_generic_init(mcrypt_tdid, key, 16, IV);
	if (i<0) {
		mcrypt_perror(i);
		return(-1);
	}

	return(16);
}

int cipher_serpent_encrypt(const char *inblk, char *outblk, int blksize, char *key, unsigned char *IV) {
	int i;

	memcpy(outblk, inblk, blksize);
	for (i=0; i<blksize; i++) {
		mcrypt_generic(mcrypt_tdid, &outblk[i], 1);
	}
	return(blksize);
}

int cipher_serpent_decrypt(const char *inblk, char *outblk, int blksize, char *key, unsigned char *IV) {
	int i;

	memcpy(outblk, inblk, blksize);
	for (i=0; i<blksize; i++) {
		mdecrypt_generic(mcrypt_tdid, outblk+i, 1);
	}
	return(blksize);
}
#else
int cipher_serpent(const char *inblock, char *outblock, const int blksize, char *key, const int mode) {
	return(0);
}
#endif

#ifndef _CIPHER_SERPENT_H
#define _CIPHER_SERPENT_H
#include "dact.h"
#include "comp_fail.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define cipher_serpent DACT_FAILED_ALGO
#else

#if defined(HAVE_LIBMCRYPT) && defined(HAVE_MCRYPT_H)
#define HAVE_MCRYPT 1
#include <mcrypt.h>
int cipher_serpent_init(const int mode, char *key, unsigned char *IV);
int cipher_serpent_encrypt(const char *inblk, char *outblk, int blksize, char *key, unsigned char *IV);
int cipher_serpent_decrypt(const char *inblk, char *outblk, int blksize, char *key, unsigned char *IV);
#endif

int cipher_serpent(const char *inblock, char *outblock, const int blksize, char *key, const int mode);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

/*
	Encrypt data.
*/
#include "cipher_sub.h"
#include "parse.h"
#include "dact.h"
#include "ui.h"
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#include <fcntl.h>
#include <stdio.h>
#ifndef RANDOM_DEV
#include <time.h>
#endif

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=1;
uint32_t DC_TYPE=DACT_MOD_TYPE_ENC;
void *DC_ALGO=cipher_sub;
char *DC_NAME="subst (MOD)";
#endif


int cipher_sub(const char *inblock, char *outblock, const int blksize, char *key, const int mode) {
	switch (mode) {
		case (DACT_MODE_CINIT+DACT_MODE_CDEC):
		case (DACT_MODE_CINIT+DACT_MODE_CENC):
		case DACT_MODE_CINIT:
			return(cipher_sub_init(mode,key));
			break;
		case DACT_MODE_CDEC:
			return(cipher_sub_decrypt(inblock, outblock, blksize, key));
			break;
		case DACT_MODE_CENC:
			return(cipher_sub_encrypt(inblock, outblock, blksize, key));
			break;
	}
	return(0);
}


int cipher_sub_init(const int mode, char *key) {
	return(cipher_sub_init_getkey(mode-DACT_MODE_CINIT,key));
}

int cipher_sub_init_getkey(const int mode, char *key) {
	char *fname;
	char keybuf[1024], *ptrbuf;
	int fd,x=257;

	fname=dact_ui_getuserinput("Key file: ",128,0);
	fd=open(fname, O_RDONLY);
	if (fd>=0) {
		x=read(fd, &keybuf, sizeof(keybuf));
		if (x==257) {
			memcpy(key,keybuf,257); /* For backward compatability with DACT 0.8.1*/
		} else {
			memcpy(key,ptrbuf=demime64(keybuf),257);
			free(ptrbuf);
		}
		close(fd);
		return(257);
	}
	if (fd<0 && mode==DACT_MODE_CENC) {
		fd=open(fname, O_WRONLY|O_CREAT|O_TRUNC, 0600);
		if (fd<0) { PERROR("open"); return(0); }
		memcpy(key,generatekey(),257);
		memcpy(keybuf, ptrbuf=mimes64(key,&x), 400);
		write(fd, keybuf, x);
		write(fd, "\n", 1);
		close(fd);
		free(ptrbuf);
		return(257);
	}
	return(-1);
}

int cipher_sub_encrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key) {
	int i,mod;
	static int keyoffset=0;

	mod=(int) key[0];
	for (i=0;i<blksize;i++) {
		if (!(i%mod)) {
			keyoffset=((keyoffset+1)&0xff);
		}
		outblk[i]=key[((((int) inblk[i])+keyoffset)&0xff)+1];
	}
	return(blksize);
}

int cipher_sub_decrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key) {
	int i,mod,x;
	char reversekey[256];
	static int keyoffset=0;

	mod=(int) key[0];
	for (i=1;i<257;i++) reversekey[(int) key[i]]=(i-1);
	for (i=0;i<blksize;i++) {
		if (!(i%mod)) {
			keyoffset=((keyoffset+1)&0xff);
			for (x=0;x<256;x++) reversekey[(int) key[((x+keyoffset)&0xff)+1]]=x;
		}
		outblk[i]=reversekey[(int) inblk[i]];
	}
	return(blksize);
}

char *generatekey(void) {
	static char key[257];
	char used[256];
	int i,x;
#ifdef RANDOM_DEV
	unsigned char buff[1];
	int fd;
	fd=open(RANDOM_DEV, O_RDONLY);
	read(fd, buff, 1);
	if (buff[0]==0) buff[0]=3;
	key[0]=buff[0];
#else
	srand(time(NULL)+rand());
	key[0]=1+(int) (255.0*rand()/(RAND_MAX+1.0));
#endif
	for (i=0;i<256;i++) used[i]=0;
	for (i=1;i<257;i++) {
#ifdef RANDOM_DEV
		read(fd, buff, 1);
		x=buff[0];
#else
		srand(time(NULL)+rand());
		x=(int) (256.0*rand()/(RAND_MAX+1.0));
#endif
		if (used[x]==0) { key[i]=x; used[x]=1; } else { i--; }
	}
#ifdef RANDOM_DEV
	close(fd);
#endif
	return(key);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _CIPHER_SUB_H
#define _CIPHER_SUB_H
#include "dact.h"
#include "comp_fail.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define cipher_sub DACT_FAILED_ALGO
#else


int cipher_sub(const char *inblock, char *outblock, const int blksize, char *key, const int mode);
int cipher_sub_init(const int mode, char *key);
int cipher_sub_init_getkey(const int mode, char *key);
int cipher_sub_encrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key);
int cipher_sub_decrypt(const unsigned char *inblk, unsigned char *outblk, int blksize, unsigned char *key);
char *generatekey(void);

#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _CIPHERS_H
#define _CIPHERS_H
#include "cipher_chaos.h"
#include "cipher_sub.h"
#include "cipher_serpent.h"
#include "cipher_psub.h"


#ifndef CIPHER_COUNT
#define CIPHER_COUNT 5
#endif

#ifdef __DACT_C
int (*(ciphers[CIPHER_COUNT]))()={
	cipher_chaos,
	cipher_sub,
#ifdef HAVE_LIBMCRYPT
	cipher_serpent,
#else
	NULL,
#endif
	cipher_psub,
	NULL
};

char *ciphers_name[CIPHER_COUNT]={ 		/* These must be lower-cased */
	"chaos",
	"subst",
#ifdef HAVE_LIBMCRYPT
	"serpent",
#else
	NULL,
#endif
	"psubst",
	NULL
};

#else
extern int (*(ciphers[CIPHER_COUNT]))();
extern char *ciphers_name[CIPHER_COUNT];
#endif

#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_bitsums.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/


#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=11;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_bitsums_algo;
char *DC_NAME="Bitsums Compression (MOD)";

#endif

int comp_bitsums_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_bitsums_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_bitsums_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			fprintf(stderr, "Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_bitsums_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	return(-1);
}

int comp_bitsums_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	fprintf(stderr, "Not yet supported.\n");
	return(0);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_BITSUMS_H
#define _COMP_BITSUMS_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_bitsums_algo DACT_FAILED_ALGO
#else
int comp_bitsums_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_bitsums_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_bitsums_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_bzlib.h"

#ifdef HAVE_LIBBZ2
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#include <stdio.h>
#ifdef HAVE_BZLIB_H
#include <bzlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=9;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_bzlib_algo;
char *DC_NAME="Bzip2 Compression (MOD)";
#endif

int comp_bzlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_bzlib_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_bzlib_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			fprintf(stderr, "Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_bzlib_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned int dest_size=(DACT_BLK_SIZE*2);
	int retval;

#ifdef HAVE_OLD_BZ2
	retval=bzBuffToBuffCompress(out_block, &dest_size, curr_block, blk_size, 9, 0, 9);
#else
	retval=BZ2_bzBuffToBuffCompress(out_block, &dest_size, curr_block, blk_size, 9, 0, 9);
#endif
/* Remove the "BZh9" header. */
	dest_size-=4;
	memmove(out_block, out_block+4, dest_size);

	if (retval!=BZ_OK) return(-1);

	return(dest_size);
}

int comp_bzlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned int dest_size=(DACT_BLK_SIZE*2);
	char *tmpbuf;
	int retval;

/* Replant the header. */
	tmpbuf=malloc(blk_size+4);
	memcpy(tmpbuf, "BZh9", 4);
	memcpy(tmpbuf+4, curr_block, blk_size);

#ifdef HAVE_OLD_BZ2
	retval=bzBuffToBuffDecompress(out_block, &dest_size, tmpbuf, blk_size+4, 0, 0);
#else
	retval=BZ2_bzBuffToBuffDecompress(out_block, &dest_size, tmpbuf, blk_size+4, 0, 0);
#endif

	free(tmpbuf);

	if (retval!=BZ_OK) return(0);
	return(dest_size);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_BZLIB_H
#define _COMP_BZLIB_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_bzlib_algo DACT_FAILED_ALGO
#else
int comp_bzlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_bzlib_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_bzlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-lbz2

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_delta.h"
#include "buffer.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif



/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=2;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_delta_algo;
char *DC_NAME="Delta Compression (MOD)";
#endif


int comp_delta_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_delta_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_delta_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_delta_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i,x=0,y=0;
	char Val;
	unsigned char CurrByte, PrevByte;
	signed char DeltaByte;

	bit_buffer_purge();

	CurrByte=curr_block[0];
	out_block[x]=CurrByte;
	for (i=1;i<blk_size;i++) {
		PrevByte=CurrByte;
		CurrByte=curr_block[i];
		DeltaByte=(CurrByte-PrevByte);
		if (abs(DeltaByte)<32) {
			Val=(((1<<6) | (( ( DeltaByte<0 ))<<5) | (abs(DeltaByte)&33)));
			bit_buffer_write(Val,7);
		} else {
			bit_buffer_write(CurrByte,9);
		}
		y=bit_buffer_size();
		while (y>=8 && y!=16) {
			out_block[++x]=bit_buffer_read(8);
			if (x>=DACT_BLK_SIZE*2) return(-1);
			y=bit_buffer_size();
		}
		
	}
	y=bit_buffer_size();
	if (y!=0) {
		out_block[++x]=(bit_buffer_read(y)<<(8-y));
	}
	return(x+1);
}

int comp_delta_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i=0,x=0;
	unsigned char CurrByte;
	unsigned char DeltaByte;
	char CompBit;
	char Neg;
	char Val;

	CurrByte=curr_block[0];
	bit_buffer_purge();
	while (1) {
		if ((bit_buffer_size()<=8) && i==blk_size) break;
		if ((bit_buffer_size()<=8) && i!=blk_size)
			bit_buffer_write((unsigned char) curr_block[++i],8);
		CompBit=bit_buffer_read(1);
		if ((bit_buffer_size()<=8) && i!=blk_size)
			bit_buffer_write((unsigned char) curr_block[++i],8);

		if (CompBit==1) {
			Neg=bit_buffer_read(1);
			DeltaByte=bit_buffer_read(5);
			Val=CurrByte+(((-2*Neg)+1)*DeltaByte);
		} else {
			Val=bit_buffer_read(8);
		}
		out_block[x++]=CurrByte;
		CurrByte=Val;
	}
	return(x);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_DELTA_H
#define _COMP_DELTA_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_delta_algo DACT_FAILED_ALGO
#else
int comp_delta_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_delta_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_delta_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_factor.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/
#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=10;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_factor_algo;
char *DC_NAME="Factor Compression (MOD)";
#endif
int comp_factor_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_factor_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_factor_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			fprintf(stderr, "Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_factor_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	return(-1);
}

int comp_factor_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	fprintf(stderr, "Not yet supported.\n");
	return(0);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_FACTOR_H
#define _COMP_FACTOR_H

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_factor_algo DACT_FAILED_ALGO
#else
int comp_factor_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_factor_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_factor_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


/*
	Ignore requests for compression and return errors for decompression.
	Stub algorithm.

*/


#include "dact.h"
#include "comp_fail.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/
int comp_fail_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_fail_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_fail_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_fail_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	return(-1);
}

int comp_fail_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	printf("You tried to decompress a file with an algorithm that is not compiled into your version.  Output will be unusable.\n");
	return(0);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_FAIL_H
#define _COMP_FAIL_H

int comp_fail_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_fail_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_fail_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_lzoox.h"
#ifndef comp_lzoox_algo
#include <lzoconf.h>
#include <lzo1x.h>
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=13;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_lzoox_algo;
char *DC_NAME="LZO-1x Compression (MOD)";
/*
char *DC_SIGN="RGlnaXRhbFNpZ25hdHVyZQ==";
char *DC_URL_GET="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.dll";
char *DC_URL_VER="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.ver";
uint32_t DC_VER=0x00080d;
uint32_t DC_REQUIRE=DACT_MOD_REQ_ATLEAST|(0x00080d);
*/
#endif

int comp_lzoox_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_lzoox_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_lzoox_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_lzoox_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0;
	char *wrkmem;

	if ((wrkmem=malloc(LZO1X_999_MEM_COMPRESS))==NULL) return(-1);
	if (lzo_init()!=LZO_E_OK) return(-1);
	lzo1x_999_compress(curr_block, blk_size, out_block, &retsize, wrkmem);
	free(wrkmem);
	return(retsize);
}

int comp_lzoox_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0, retval;

	if (lzo_init()!=LZO_E_OK) return(-1);
	retval=lzo1x_decompress(curr_block, blk_size, out_block, &retsize, NULL);
	if (retval!=LZO_E_OK) return(-1);
	return(retsize);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_LZOOX_H
#define _COMP_LZOOX_H
#include "dact.h"
#include "config.h"

#if (defined(USE_MODULES) && !defined(AS_MODULE)) || !defined(HAVE_LIBLZO) || !defined(HAVE_LZOCONF_H) || !defined(HAVE_LZO1X_H)
#define comp_lzoox_algo DACT_FAILED_ALGO
#else
int comp_lzoox_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzoox_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzoox_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-llzo

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_lzooy.h"
#ifndef comp_lzooy_algo
#include <lzoconf.h>
#include <lzo1y.h>
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=14;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_lzooy_algo;
char *DC_NAME="LZO-1y Compression (MOD)";
/*
char *DC_SIGN="RGlnaXRhbFNpZ25hdHVyZQ==";
char *DC_URL_GET="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.dll";
char *DC_URL_VER="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.ver";
uint32_t DC_VER=0x00080d;
uint32_t DC_REQUIRE=DACT_MOD_REQ_ATLEAST|(0x00080d);
*/
#endif

int comp_lzooy_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_lzooy_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_lzooy_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_lzooy_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0;
	char *wrkmem;

	if ((wrkmem=malloc(LZO1Y_999_MEM_COMPRESS))==NULL) return(-1);
	if (lzo_init()!=LZO_E_OK) return(-1);
	lzo1y_999_compress(curr_block, blk_size, out_block, &retsize, wrkmem);
	free(wrkmem);
	return(retsize);
}

int comp_lzooy_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0, retval;

	if (lzo_init()!=LZO_E_OK) return(-1);
	retval=lzo1y_decompress(curr_block, blk_size, out_block, &retsize, NULL);
	if (retval!=LZO_E_OK) return(-1);
	return(retsize);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_LZOOY_H
#define _COMP_LZOOY_H
#include "dact.h"
#include "config.h"

#if (defined(USE_MODULES) && !defined(AS_MODULE)) || !defined(HAVE_LIBLZO) || !defined(HAVE_LIBLZO) || !defined(HAVE_LZO1Y_H)
#define comp_lzooy_algo DACT_FAILED_ALGO
#else
int comp_lzooy_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzooy_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzooy_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-llzo

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_lzota.h"
#ifndef comp_lzota_algo
#include <lzoconf.h>
#include <lzo2a.h>
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=15;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_lzota_algo;
char *DC_NAME="LZO-2a Compression (MOD)";
/*
char *DC_SIGN="RGlnaXRhbFNpZ25hdHVyZQ==";
char *DC_URL_GET="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.dll";
char *DC_URL_VER="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.ver";
uint32_t DC_VER=0x00080d;
uint32_t DC_REQUIRE=DACT_MOD_REQ_ATLEAST|(0x00080d);
*/
#endif

int comp_lzota_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_lzota_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_lzota_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_lzota_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0;
	char *wrkmem;

	if ((wrkmem=malloc(LZO2A_999_MEM_COMPRESS))==NULL) return(-1);
	if (lzo_init()!=LZO_E_OK) return(-1);
	lzo2a_999_compress(curr_block, blk_size, out_block, &retsize, wrkmem);
	free(wrkmem);
	return(retsize);
}

int comp_lzota_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int retsize=0, retval;

	if (lzo_init()!=LZO_E_OK) return(-1);
	retval=lzo2a_decompress(curr_block, blk_size, out_block, &retsize, NULL);
	if (retval!=LZO_E_OK) return(-1);
	return(retsize);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_LZOTA_H
#define _COMP_LZOTA_H
#include "dact.h"
#include "config.h"

#if (defined(USE_MODULES) && !defined(AS_MODULE)) || !defined(HAVE_LIBLZO) || !defined(HAVE_LIBLZO) || !defined(HAVE_LZO2A_H)
#define comp_lzota_algo DACT_FAILED_ALGO
#else
int comp_lzota_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzota_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_lzota_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-llzo

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_mzlib.h"

#ifdef HAVE_LIBZ
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_ZLIB_H
#include <zlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=5;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_mzlib_algo;
char *DC_NAME="Modifed Zlib Compression (MOD)";
#endif

int comp_mzlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_mzlib_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_mzlib_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_mzlib_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned long dest_size;
	char *tmp_block;
	int retval;
	int i;

	dest_size=(int) ((float) (blk_size*1.02)+15);

	if ((tmp_block=malloc(dest_size))==NULL) {
		return(-1);
	}
	memcpy(tmp_block,curr_block,blk_size);

	for (i=0;i<blk_size;i++) {
/*
		tmp_block[i]=( \
			(  (tmp_block[i]&0x80) >> 7 ) + \
			(  (tmp_block[i]&0x20) >> 4 ) + \
			(  (tmp_block[i]&0x08) >> 1 ) + \
			(  (tmp_block[i]&0x02) << 2 ) + \
			(  (tmp_block[i]&0x40) >> 2 ) + \
			(  (tmp_block[i]&0x10) << 1 ) + \
			(  (tmp_block[i]&0x04) << 4 ) + \
			(  (tmp_block[i]&0x01) << 7 ) \
		);
*/
		tmp_block[i]=( ((tmp_block[i]&0xf0)>>4) + (  (tmp_block[i]&0x0f)  <<4) );
	}
#ifdef HAVE_COMPRESS2
	retval=compress2(out_block, &dest_size, tmp_block, blk_size, Z_BEST_COMPRESSION);
#else
	retval=compress(out_block, &dest_size, tmp_block, blk_size);
#endif
	if (retval!=Z_OK) {
		return(-1);
	}
	free(tmp_block);
	return(dest_size);
}

int comp_mzlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned long dest_size=(DACT_BLK_SIZE*2);
	int retval;
	int i;

	retval=uncompress(out_block,&dest_size,curr_block,blk_size);

	if (retval!=Z_OK) {
		return(0);
	}

	for (i=0;i<dest_size;i++) {
		out_block[i]=( ( (out_block[i]&0xf0)>>4) + ((out_block[i]&0x0f)<<4) );
	}

	return(dest_size);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_MZLIB_H
#define _COMP_MZLIB_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_mzlib_algo DACT_FAILED_ALGO
#else
int comp_mzlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_mzlib_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_mzlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-lz

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


/*
	Compress by gathering bytes that are most often placed near each other
	and rearranging the ASCII Charectar Set to make those bytes have
	similar values.

*/


#include "dact.h"
#include "comp_mzlib2.h"
#ifndef comp_mzlib2_algo

#ifdef HAVE_LIBZ
#ifdef HAVE_ZLIB_H
#include <zlib.h>
#endif
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#include "sort.h"
#define SQRD_256 65536


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/
#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=8;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_mzlib2_algo;
char *DC_NAME="Second Modified Zlib Compression (MOD)";
#endif

#ifdef DEBUG
#if DEBUG>=2
#define MAKE_MZLIB2 1
#endif
#endif

#ifdef MAKE_MZLIB2
int comp_mzlib2_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_mzlib2_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_mzlib2_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}
#else
int comp_mzlib2_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	return(-1);
}
#endif

int comp_mzlib2_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned long dest_size;
	unsigned char *tmp_block;
	uint32_t freq[SQRD_256];
	uint16_t lookup_table[SQRD_256], curr_val, repl_val;
	int i, cnt, m=2, retval, low_byte=0, x;

	memset(freq,0,sizeof(freq));

	for (i=0;i<blk_size;i+=2) {
		x=(curr_block[i]<<8)|(curr_block[i+1]);
		freq[x]++;
//SPOTVAR_NUM(freq[x]);
		if (freq[x]==0xffff) return(-1);
	}

//	for (i=0;i<SQRD_256;i++) {
//		if (freq[i]!=0) {
//			PRINT_LINE; fprintf(stderr, "%04x: 0x%02x and 0x%02x are near each other %i times\n",i,i>>8,i&0xff,freq[i]);
//		}
//	}

	int_sort_fast(freq, SQRD_256, 0);

	for (i=0;i<(SQRD_256);i++) {
		if ((freq[i]&0xffff)!=0) {
			out_block[m++]=freq[i]>>24;
			out_block[m++]=(freq[i]>>16)&0xff;
			if (m>=(DACT_BLK_SIZE*2)) {
//SPOTVAR_NUM(m);
				return(-1);
			}
			lookup_table[freq[i]>>16]=i;
			PRINT_LINE; fprintf(stderr, "%04x: 0x%02x and 0x%02x are near each other %i times\n",i,(freq[i]>>24),(freq[i]>>16)&0xff,freq[i]&0xffff);
		} else {
			break;
		}
	}

	cnt=(m-2);
	out_block[0]=((m-2)>>8);
	out_block[1]=((m-2)&0xff);
	if ((m-2)<0x200) low_byte=1;

	for (i=0;i<blk_size;i+=2) {
		curr_val=((curr_block[i]<<8)| curr_block[i+1]);
		repl_val=lookup_table[curr_val];
		if (!low_byte) 
			out_block[m++]=repl_val>>8;
		out_block[m++]=repl_val&0xff;
SPOTVAR_NUM(m);
		if (m>=(DACT_BLK_SIZE*2)) return(-1);
	}

	dest_size=(int) ((float) ((m*1.02)+15));
SPOTVAR_NUM(dest_size);
	if ((tmp_block=malloc(dest_size))==NULL) {
		return(-1);
	}
        memcpy(tmp_block,out_block,m);
/*
	for (i=0;i<m;i++) {
		printf("%02x ", tmp_block[i]);
		if (i==(cnt+2)) printf("-- ");
		if (((i+1)%25)==0) printf("\n");
	}
	printf("\n\n");
*/

/*
	for (i=0;i<blk_size;i++) printf("%02x ", curr_block[i]);
	printf("\n");
*/

	retval=compress(out_block, &dest_size, tmp_block, m);
	if (retval!=Z_OK) {
		return(blk_size*2);
	}

	free(tmp_block);
	return(dest_size);
}

int comp_mzlib2_decompress(unsigned char *prev_block, unsigned char *curr_block, unsigned char *out_block, int blk_size) {
	uint16_t lookup_table[SQRD_256], curr_val, repl_val;
	unsigned long dest_size=(DACT_BLK_SIZE*2);
	unsigned char *tmp_block;
	unsigned int m=0, hdrsize;
	int retval, i, low_byte=0;

	tmp_block=malloc(dest_size);
	retval=uncompress(tmp_block,&dest_size,curr_block,blk_size);

	if (retval!=Z_OK) return(0);

	hdrsize=((unsigned int) (((tmp_block[0]<<8)|tmp_block[1])))+2;

	if ((hdrsize-2)<0x200) low_byte=1;

	for (i=2;i<hdrsize;i+=2) {
		lookup_table[(i-2)/2]=((tmp_block[i]<<8)|tmp_block[i+1]);
	}

	for (i=hdrsize;i<(dest_size);i+=(2-low_byte)) {
		if (low_byte) {
			curr_val=tmp_block[i];
		} else {
			curr_val=((tmp_block[i]<<8)|tmp_block[i+1]);
		}
		repl_val=lookup_table[curr_val];
		out_block[m++]=repl_val>>8;
		out_block[m++]=repl_val&0xff;
	}

/*
	for (i=0;i<m;i++) printf("%02x ", out_block[i]);
	printf("\n");
*/

	free(tmp_block);
	return(m);
}
#endif

#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_MZLIB2_H
#define _COMP_MZLIB2_H
#include "dact.h"
#include "config.h"

#if (defined(USE_MODULES) && !defined(AS_MODULE)) || !defined(DEBUG)
#define comp_mzlib2_algo DACT_FAILED_ALGO
#else
int comp_mzlib2_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_mzlib2_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_mzlib2_decompress(unsigned char *prev_block, unsigned char *curr_block,unsigned char *out_block, int blk_size);
#endif
#endif

-lz

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


/*
	Example block compression routine for interfacing with DACT.

	This does no compression.

	(This is used as the minimum case, so block can be atmost blk_size
	+3 bytes in size)
*/


#include "dact.h"
#include "comp_plain.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/
int comp_plain_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_plain_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_plain_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_plain_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	memcpy(out_block,curr_block,blk_size);
	return(blk_size);
}

int comp_plain_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	memcpy(out_block,curr_block,blk_size);
	return(blk_size);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_PLAIN_H
#define _COMP_PLAIN_H

int comp_plain_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_plain_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_plain_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_rle.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=1;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_rle_algo;
char *DC_NAME="RLE Compression (MOD)";
char *DC_SIGN="RGlnaXRhbFNpZ25hdHVyZQ==";
char *DC_URL_GET="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.dll";
char *DC_URL_VER="http://www.rkeene.org/projects/compression/dact/@@OSNM@@-@@ARCH@@/comp_rle.ver";
uint32_t DC_VER=0x00080d;
uint32_t DC_REQUIRE=DACT_MOD_REQ_ATLEAST|(0x00080d);
#endif

int comp_rle_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_rle_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_rle_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_rle_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i,x=0,m;
	unsigned char sentinel=0xff;
	unsigned char currchar=0, prevchar;
	unsigned char charcnt=0;
	unsigned int lowestcnt=0xffff;
	unsigned int count[256];

	for (i=0;i<256;i++) count[i]=0;

	for (i=0;i<blk_size;i++) count[curr_block[i]]++;

	for (i=0;i<256;i++) {
		if (count[i]<lowestcnt) {
			sentinel=i;
			lowestcnt=count[i];
		}
	}

	out_block[x++]=sentinel;

	prevchar=curr_block[0];
	for (i=0;i<(blk_size+1);i++) {
		if (i!=blk_size) { currchar=curr_block[i]; } else { currchar++; }
		if (prevchar!=currchar || charcnt==255 || i>=(blk_size)) {
			if (charcnt<=2 && prevchar!=sentinel) {
				for (m=0;m<charcnt;m++) out_block[x++]=prevchar;
			} else {
				out_block[x++]=sentinel;
				out_block[x++]=prevchar;
				out_block[x++]=charcnt;
			}
			charcnt=0;
		}
		charcnt++;
		prevchar=currchar;
	}
	return(x);
}

int comp_rle_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i,x=0,m;
	unsigned char sentinel=curr_block[0];
	unsigned char currchar;
	unsigned char charcnt;

	for (i=1;i<blk_size;i++) {
		currchar=curr_block[i];
		if (currchar==sentinel) {
			currchar=curr_block[++i];
			charcnt=curr_block[++i];
			if ((x+charcnt)>DACT_BLK_SIZE) {
				printf("Error in RLE compression!\n");
				return(0);
			}
			for (m=0;m<charcnt;m++) out_block[x++]=currchar;
		} else {
			out_block[x++]=currchar;
		}
	}
	return(x);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_RLE_H
#define _COMP_RLE_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_rle_algo DACT_FAILED_ALGO
#else
int comp_rle_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_rle_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_rle_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


/*
	Example block compression routine for interfacing with DACT.


	Seminibble Compression (Actually, a 2bit Huffman Implementation)

*/


#include "dact.h"
#include "comp_snibble.h"
#include "buffer.h"
#include "sort.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=6;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_snibble_algo;
char *DC_NAME="Seminibble Encoding (MOD)";
#endif

int comp_snibble_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_snibble_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_snibble_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_snibble_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	char *curr_cpy;
	const static unsigned char hash_table[4]={0, 2, 6, 7};
	const static unsigned char hash_len[8]=  {1, 0, 2, 0, 0, 0, 3, 3};
	uint32_t freq[4]={0, 0, 0, 0};
	unsigned char lookup_table[4]={0, 0, 0, 0};
	int i,x,m,g=0;

	if ((curr_cpy=malloc(blk_size))==NULL) {
		return(-1);
	}
	memcpy(curr_cpy,curr_block,blk_size);

	bit_buffer_purge();

	for (i=0;i<blk_size;i++) {
		freq[(int) ((curr_cpy[i]&0xc0)>>6)]++;
		freq[(int) ((curr_cpy[i]&0x30)>>4)]++;
		freq[(int) ((curr_cpy[i]&0x0c)>>2)]++;
		freq[(int) ((curr_cpy[i]&0x03))]++;
	}

	int_sort(freq,4,1);

	for (i=0;i<4;i++) lookup_table[freq[i]]=hash_table[i];

	bit_buffer_write(freq[0],2);
	bit_buffer_write(freq[1],2);
	bit_buffer_write(freq[2],2);

/*
	outsize=((int) ((((((float) (freq[0]&0xffff))/2)+(freq[1]&0xffff)+(((float) (freq[2]&0xffff)+(freq[3]&0xffff))*1.5))/4.0)+0.99));

*/
	for (i=0;i<blk_size;i++) {
		for (x=0;x<4;x++) {
			m=((curr_cpy[i]&(3<<(x*2)))>>( x*2 ))  ;
			bit_buffer_write(lookup_table[m],hash_len[lookup_table[m]]);
			while (bit_buffer_size()>=8) out_block[g++]=((unsigned char) (bit_buffer_read(8)));
		}
	}
	i=bit_buffer_size();
	if (i!=0) out_block[g++]=bit_buffer_read(i)<<(8-i);

	free(curr_cpy);

	return(g);

}

int comp_snibble_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	const static unsigned char lookup_table[8]={0, 0, 1, 0, 0, 0, 2, 3};
	unsigned int freq[4];
	unsigned int x,m=0;
	unsigned int i,g=0,cnt=0,f=0,j=0;


	freq[0]=(curr_block[0]&0xc0)>>6; /* 0 */
	freq[1]=(curr_block[0]&0x30)>>4; /* 2 */
	freq[2]=(curr_block[0]&0x0c)>>2; /* 6 */
	for (i=0;i<4;i++) {
		if (freq[0]!=i && freq[1]!=i && freq[2]!=i) freq[3]=i;
	}
	out_block[0]=0;

	bit_buffer_purge();

	bit_buffer_write(curr_block[g++]&0x03,2);

	while (1) {
		while (((bit_buffer_size()+8)<=16) && g<=blk_size) bit_buffer_write(curr_block[g++],8);
		x=bit_buffer_read(1);
		m=(m<<1)+x;
		cnt++;
		if (x==0 || cnt==3) {
			out_block[f]|=(freq[lookup_table[m]]<<( j )) ;
			j+=2;
/* Obsficated comes to mind ... */
			if (j==8) out_block[++f]=(j=0);
			m=0;
			cnt=0;
		}
		if (bit_buffer_size()==0 || f==DACT_BLK_SIZE) break;
	}

	return(f);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_SNIBBLE_H
#define _COMP_SNIBBLE_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_snibble_algo DACT_FAILED_ALGO
#else
int comp_snibble_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_snibble_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_snibble_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_text.h"
#include "buffer.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=3;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_text_algo;
char *DC_NAME="Text Compression (MOD)";
#endif

int comp_text_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_text_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_text_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_text_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned char low_byte=255, high_byte=0;
	unsigned char byte_buf;
	unsigned int range;
	int i,x=0,y;


	bit_buffer_purge();

	for (i=0;i<blk_size;i++) {
		if (((unsigned char) curr_block[i])<low_byte) low_byte=curr_block[i];
		if (((unsigned char) curr_block[i])>high_byte) high_byte=curr_block[i];
	}

	range=(unsigned int) (high_byte-low_byte);

	out_block[x++]=low_byte;
	out_block[x++]=high_byte;

	if (range==0)
		return(2);

	for (y=1;y<=8;y++)
		if ((range>>y)==0) break;
	if (y==8) return(-1);

	for (i=0;i<blk_size;i++) {
		byte_buf=(unsigned char) (curr_block[i]-low_byte);
/*
		if ((byte_buf>>y)==1) {
			return(-1);
		}
*/
		bit_buffer_write(byte_buf,y);

		while (bit_buffer_size()>=8) {
			out_block[x++]=bit_buffer_read(8);
		}
	}
/* 		Remove any less-than-one-byte data */
	if ((i=bit_buffer_size())!=0) {
		out_block[x++]=(bit_buffer_read(i)<<(8-i));
	}

	return(x);
}

int comp_text_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned char high_byte, low_byte;
	unsigned int range;
	int i=0,x=0,y;
	
	low_byte=curr_block[x++];
	high_byte=curr_block[x++];
	range=(unsigned int) (high_byte-low_byte);

	if (range==0) {
		memset(out_block,low_byte,DACT_BLK_SIZE);
		return(DACT_BLK_SIZE);
	}
        for (y=1;y<=8;y++)
                if ((range>>y)==0) break;

	bit_buffer_purge();

	while (1) {
		if (bit_buffer_size()<y) bit_buffer_write((unsigned char) curr_block[x++],8);
		out_block[i++]=(bit_buffer_read(y)+low_byte);
		if ((x==blk_size) && (bit_buffer_size()<y)) break;
		if (i>=(DACT_BLK_SIZE)) break;
	}

	return(i);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_TEXT_H
#define _COMP_TEXT_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_text_algo DACT_FAILED_ALGO
#else
int comp_text_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_text_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_text_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


#include "dact.h"
#include "comp_textrle.h"
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(AS_MODULE) && defined(USE_MODULES)
#include "module.h"
uint32_t DC_NUM=12;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_textrle_algo;
char *DC_NAME="Text RLE Compression (MOD)";
#endif

int comp_textrle_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_textrle_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_textrle_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_textrle_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i,x=0,m;
	unsigned char sentinel=0xff;
	unsigned char currchar=0, prevchar;
	unsigned char charcnt=0;
	unsigned int lowestcnt=0xffff;
	unsigned int count[256];

	for (i=0;i<256;i++) count[i]=0;

	for (i=0;i<blk_size;i++) count[curr_block[i]]++;

	for (i=0;i<256;i++) {
		if (count[i]<lowestcnt) {
			sentinel=i;
			lowestcnt=count[i];
		}
	}

	out_block[x++]=sentinel;

	

	return(x);
}

int comp_textrle_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	int i,x=0,m;
	unsigned char sentinel=curr_block[0];
	unsigned char currchar;
	unsigned char charcnt;

	for (i=1;i<blk_size;i++) {
		currchar=curr_block[i];
		if (currchar==sentinel) {
			currchar=curr_block[++i];
			charcnt=curr_block[++i];
			if ((x+charcnt)>DACT_BLK_SIZE) {
				printf("Error in RLE compression!\n");
				return(0);
			}
			for (m=0;m<charcnt;m++) out_block[x++]=currchar;
		} else {
			out_block[x++]=currchar;
		}
	}
	return(x);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_TEXTRLE_H
#define _COMP_TEXTRLE_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_textrle_algo DACT_FAILED_ALGO
#else
int comp_textrle_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_textrle_compress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_textrle_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */


/*
	Example block compression routine for interfacing with DACT.

	Uses zlib.
*/


#include "dact.h"
#include "comp_zlib.h"

#ifdef HAVE_LIBZ
#include <stdio.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_ZLIB_H
#include <zlib.h>
#endif


/*
	mode 		- DACT_MODE_COMPR or DACT_MODE_DECMP
			    Determine whether to compress or decompress.
	prev_block	- Previous (uncompressed) block.
	curr_block	- The data to be compressed.
	out_block	- Where to put data after compression.
	blk_size	- Size of prev_block and curr_block.
*/

#if defined(USE_MODULES) && defined(AS_MODULE)
#include "module.h"
uint32_t DC_NUM=4;
uint32_t DC_TYPE=DACT_MOD_TYPE_COMP;
void *DC_ALGO=comp_zlib_algo;
char *DC_NAME="Zlib Compression (MOD)";
#endif

int comp_zlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	switch(mode) {
		case DACT_MODE_COMPR:
			return(comp_zlib_compress(prev_block,curr_block,out_block,blk_size));
			break; /* Heh */
		case DACT_MODE_DECMP:
			return(comp_zlib_decompress(prev_block,curr_block,out_block,blk_size));
			break;
		default:
			printf("Unsupported mode: %i\n", mode);
			return(-1);
	}
}

int comp_zlib_compress(unsigned char *prev_block, unsigned char *curr_block, unsigned char *out_block, int blk_size) {
	unsigned long dest_size;
	int retval;
	dest_size=(int) ((float) (blk_size*1.01)+13);

#ifdef HAVE_COMPRESS2
	retval=compress2(out_block, &dest_size, curr_block, blk_size, Z_BEST_COMPRESSION);
#else
	retval=compress(out_block, &dest_size, curr_block, blk_size);
#endif
	if (retval!=Z_OK) return(-1);
/* Remove the 120,218 header */
	dest_size-=2;
	memmove(out_block, out_block+2, dest_size);

	return(dest_size);
}

int comp_zlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size) {
	unsigned long dest_size;
	unsigned char *tmpbuf;
	int retval;

/* Replant the header. */
	tmpbuf=malloc(blk_size+2);
	tmpbuf[0]=120;
	tmpbuf[1]=218;
	memcpy(tmpbuf+2, curr_block, blk_size);

	dest_size=(DACT_BLK_SIZE*2);
	retval=uncompress(out_block,&dest_size,tmpbuf,blk_size+2);

	free(tmpbuf);

	if (retval!=Z_OK) return(0);

	return(dest_size);
}
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _COMP_ZLIB_H
#define _COMP_ZLIB_H
#include "dact.h"
#include "config.h"

#if defined(USE_MODULES) && !defined(AS_MODULE)
#define comp_zlib_algo DACT_FAILED_ALGO
#else
int comp_zlib_algo(int mode, unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
int comp_zlib_compress(unsigned char *prev_block, unsigned char *curr_block, unsigned char *out_block, int blk_size);
int comp_zlib_decompress(unsigned char *prev_block, unsigned char *curr_block, char *out_block, int blk_size);
#endif
#endif

-lz

/* config.h.in.  Generated from configure.in by autoheader.  */

/* Check for new versions over the network? */
#undef CHECK_VERSION

/* Use the Debian upgrade procedure instead of DACTs internal one */
#undef DACT_DEBIAN_UPGRADE_PROC

/* Debug */
#undef DEBUG

/* Have bzdopen() ? */
#undef HAVE_BZDOPEN

/* Define to 1 if you have the <bzlib.h> header file. */
#undef HAVE_BZLIB_H

/* Have more versatile compress2() ? */
#undef HAVE_COMPRESS2

/* Have random device? */
#undef HAVE_DEV_URANDOM

/* Define to 1 if you have the <dirent.h> header file. */
#undef HAVE_DIRENT_H

/* Define to 1 if you have the <dlfcn.h> header file. */
#undef HAVE_DLFCN_H

/* Have dlopen()? */
#undef HAVE_DLOPEN

/* Define to 1 if you have the `getopt' function. */
#undef HAVE_GETOPT

/* Define to 1 if you have the <getopt.h> header file. */
#undef HAVE_GETOPT_H

/* Define to 1 if you have the `getpass' function. */
#undef HAVE_GETPASS

/* Have gzdopen() ? */
#undef HAVE_GZDOPEN

/* Have inet_aton() ? */
#undef HAVE_INET_ATON

/* Define to 1 if you have the <inttypes.h> header file. */
#undef HAVE_INTTYPES_H

/* Something */
#undef HAVE_LIBBZ2

/* Also something */
#undef HAVE_LIBLZO

/* Something */
#undef HAVE_LIBMCRYPT

/* Something */
#undef HAVE_LIBZ

/* Define to 1 if you have the <lzo1x.h> header file. */
#undef HAVE_LZO1X_H

/* Define to 1 if you have the <lzo1y.h> header file. */
#undef HAVE_LZO1Y_H

/* Define to 1 if you have the <lzo2a.h> header file. */
#undef HAVE_LZO2A_H

/* Define to 1 if you have the <lzoconf.h> header file. */
#undef HAVE_LZOCONF_H

/* Define to 1 if you have the <mcrypt.h> header file. */
#undef HAVE_MCRYPT_H

/* Define to 1 if you have the <memory.h> header file. */
#undef HAVE_MEMORY_H

/* Define to 1 if you have the `mkstemp' function. */
#undef HAVE_MKSTEMP

/* Have BZ2_ prefixed to all bzip2 symbols? */
#undef HAVE_NEW_BZ2

/* Have BZ2_bzdopen() ? */
#undef HAVE_NEW_BZDOPEN

/* Do not have BZ2_ prefixed to all bzip2 symbols? */
#undef HAVE_OLD_BZ2

/* Define to 1 if you have the <stdint.h> header file. */
#undef HAVE_STDINT_H

/* Define to 1 if you have the <stdio.h> header file. */
#undef HAVE_STDIO_H

/* Define to 1 if you have the <stdlib.h> header file. */
#undef HAVE_STDLIB_H

/* Define to 1 if you have the <strings.h> header file. */
#undef HAVE_STRINGS_H

/* Define to 1 if you have the <string.h> header file. */
#undef HAVE_STRING_H

/* Define to 1 if you have the `strsep' function. */
#undef HAVE_STRSEP

/* Define to 1 if you have the <sys/socket.h> header file. */
#undef HAVE_SYS_SOCKET_H

/* Define to 1 if you have the <sys/stat.h> header file. */
#undef HAVE_SYS_STAT_H

/* Define to 1 if you have the <sys/types.h> header file. */
#undef HAVE_SYS_TYPES_H

/* Define to 1 if you have the <sys/utsname.h> header file. */
#undef HAVE_SYS_UTSNAME_H

/* Define to 1 if you have the <sys/wait.h> header file. */
#undef HAVE_SYS_WAIT_H

/* Define to 1 if you have the <unistd.h> header file. */
#undef HAVE_UNISTD_H

/* Define to 1 if you have the <zlib.h> header file. */
#undef HAVE_ZLIB_H

/* Disable all network support */
#undef NO_NETWORK

/* Define to the address where bug reports for this package should be sent. */
#undef PACKAGE_BUGREPORT

/* Define to the full name of this package. */
#undef PACKAGE_NAME

/* Define to the full name and version of this package. */
#undef PACKAGE_STRING

/* Define to the one symbol short name of this package. */
#undef PACKAGE_TARNAME

/* Define to the version of this package. */
#undef PACKAGE_VERSION

/* The size of a `int', as computed by sizeof. */
#undef SIZEOF_INT

/* The size of a `long', as computed by sizeof. */
#undef SIZEOF_LONG

/* The size of a `short', as computed by sizeof. */
#undef SIZEOF_SHORT

/* Define to 1 if you have the ANSI C header files. */
#undef STDC_HEADERS

/* Enable use of dynamically loadable modules? */
#undef USE_MODULES

/* Define to `__inline__' or `__inline' if that's what the C compiler
   calls it, or to nothing if 'inline' is not supported under any name.  */
#ifndef __cplusplus
#undef inline
#endif

/* Define to `signed short' if <sys/types.h> does not define. */
#undef int16_t

/* Define to `signed short' if <sys/types.h> does not define. */
#undef int32_t

/* Define to `unsigned int' if <sys/types.h> does not define. */
#undef uint

/* Define to `unsigned short' if <sys/types.h> does not define. */
#undef uint16_t

/* Define to `unsigned short' if <sys/types.h> does not define. */
#undef uint32_t

dnl Process this file with autoconf to produce a configure script.
AC_REVISION($Revision $)
AC_INIT
AC_CONFIG_HEADER(config.h)

dnl Checks for programs.
AC_PROG_CC
AC_PROG_MAKE_SET
AC_PROG_INSTALL

DC_PROG_GCC

dnl Checks for libraries.

DC_CHK_DLOPEN
DC_CHK_MODULE(z, comp_zlib.c comp_mzlib.c comp_mzlib2.c, HAVE_LIBZ)
DC_CHK_MODULE(bz2, comp_bzlib.c, HAVE_LIBBZ2)
DC_CHK_MODULE(mcrypt, cipher_serpent.c, HAVE_LIBMCRYPT)
DC_CHK_MODULE_VAR(lzo, comp_lzoox.c comp_lzooy.c comp_lzota.c, HAVE_LIBLZO, MODLIBSCOND)

DC_ASK_CHKVERS
DC_ASK_NETWORK
DC_ASK_DEBUG
DC_ASK_MODULE
DC_ASK_DEBIAN
DC_CHK_URANDOM

dnl Checks for header files.
AC_CHECK_HEADERS(zlib.h getopt.h stdio.h strings.h string.h unistd.h stdint.h inttypes.h bzlib.h sys/utsname.h sys/socket.h sys/wait.h lzoconf.h lzo1x.h lzo1y.h lzo2a.h dirent.h mcrypt.h dlfcn.h)

dnl Checks for typedefs.
AC_CHECK_TYPE(uint, unsigned int)

dnl Checks for structures.

dnl Checks for compiler characteristics.
AC_C_INLINE
AC_CHECK_SIZEOF(long, 4)
AC_CHECK_SIZEOF(int, 4)
AC_CHECK_SIZEOF(short, 2)

DC_DO_TYPE(uint32_t, unsigned, 4)
DC_DO_TYPE(int32_t, signed, 4)
DC_DO_TYPE(uint16_t, unsigned, 2)
DC_DO_TYPE(int16_t, signed, 2)

dnl Checks for library functions.
AC_CHECK_LIB(z, compress2, AC_DEFINE(HAVE_COMPRESS2, [], [Have more versatile compress2() ?]))
AC_CHECK_LIB(z, gzdopen, AC_DEFINE(HAVE_GZDOPEN, [], [Have gzdopen() ?]))
AC_CHECK_LIB(bz2, bzBuffToBuffCompress, AC_DEFINE(HAVE_OLD_BZ2, [], [Do not have BZ2_ prefixed to all bzip2 symbols?]))
AC_CHECK_LIB(bz2, BZ2_bzBuffToBuffCompress, AC_DEFINE(HAVE_NEW_BZ2, [], [Have BZ2_ prefixed to all bzip2 symbols?]))
AC_CHECK_LIB(bz2, _BZ2_bzBuffToBuffCompress, AC_DEFINE(HAVE_NEW_BZ2, [], [Have BZ2_ prefixed to all bzip2 symbols?]))
AC_CHECK_LIB(bz2, bzdopen, AC_DEFINE(HAVE_BZDOPEN, [], [Have bzdopen() ?]))
AC_CHECK_LIB(bz2, BZ2_bzdopen, AC_DEFINE(HAVE_NEW_BZDOPEN, [], [Have BZ2_bzdopen() ?]))
AC_REPLACE_FUNCS(getopt strsep getpass mkstemp)

dnl Checks for system services.

AC_OUTPUT(Makefile)

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#include "dact.h"
#include "crc.h"

uint32_t ELFCRC(const uint32_t start, const unsigned char *name, const uint32_t n) {
	uint32_t i,h,g;

	h=start;
	for (i=0;i<n;i++) {
		h = (h << 4) + (*name++);
		if ((g = (h & 0xf0000000)))
			h ^= (g >> 24);
		h &= ~g;
	}

	return(h);
}

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#ifndef _CRC_H
#define _CRC_H
#include "dact.h"

uint32_t ELFCRC(const uint32_t start, const unsigned char *name, const uint32_t n);
#endif

/*
 * Copyright (C) 2001, 2002, and 2003  Roy Keene
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public License
 * as published by the Free Software Foundation; either version 2
 * of the License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 *      email: dact@rkeene.org
 */

#include "dact.h"
#include <fcntl.h>
#include <stdio.h>
#include <ctype.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#ifdef HAVE_SYS_WAIT_H
#include <sys/wait.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#include "parse.h"
#include "dendian.h"
#include "crc.h"
#include "math.h"
#include "dact_common.h"
#include "algorithms.h"
#include "ciphers.h"
#include "module.h"
#include "header.h"
#include "parse.h"
#include "net.h"
#include "ui.h"
#ifdef HAVE_ZLIB_H
#include <zlib.h>
#endif
#ifdef HAVE_BZLIB_H
#include <bzlib.h>
#endif


int print_help(int argc, char **argv);
int dact_shutdown(int retval);
char *dact_getoutfilename(const char *orig, const int mode);
uint32_t dact_process_other(int src, const int dest, const uint32_t magic, const char *options);
int main(int argc, char **argv);

extern char *optarg;
extern int optind, opterr, optopt;
uint32_t DACT_BLK_SIZE=0;
char dact_nonetwork=0;

int print_help(int argc, char **argv) {
	printf("DACT %i.%i.%i-%s by Keene Enterprises <dact@rkeene.org>\n", DACT_VER_MAJOR, DACT_VER_MINOR, DACT_VER_REVISION, DACT_VER_SUB);
	printf("usage: %s [options...] [file ...]\n",argv[0]);
	printf("Options:\n");
	printf("  -d          Decompress instead of compressing.\n");
	printf("  -s          Give statistics rather than compress or decompress.\n");
	printf("  -f          Force unsafe things to happen.\n");
	printf("  -c          (De)compress to stdout.\n");
	printf("  -v          Increase verbosity.\n");
	printf("  -l          List available algorithms.\n");
	printf("  -n          Toggle use of CRCs.\n");
	printf("  -i          Use stdin to read information from instead of /dev/tty.\n");
#ifndef DACT_UNSAFE
	printf("  -C          Complain when compression errors occur.\n");
#endif
	printf("  -H          Write only header (no data).\n");
	printf("  -O          Toggle writing original file name.\n");
	printf("  -S          Use speed-size as a metric rather than size.\n");
	printf("  -h          Give this help.\n");
	printf("  -V          Display DACT version (%i.%i.%i-%s).\n", DACT_VER_MAJOR, DACT_VER_MINOR, DACT_VER_REVISION, DACT_VER_SUB);
	printf("  -N          Upgrade DACT.\n");
	printf("  -a          Upgrade DACT modules.\n");
	printf("  -b NN       Use a block size of NN bytes for compression.\n");
	printf("  -e NN       Exclude algorithm NN from being used.\n");
	printf("  -m CONF     Load config file CONF.\n");
	printf("  -o FILE     Send output to FILE.\n");
	printf("  -u URL      Specify download location as URL.\n");
	printf("  -p URL      Parse URL and print results, then exit.\n");
	printf("  -M COMMAND  Execute COMMAND as if it had appeared in a config file.\n");
	printf("  -D DESC     Specify a description of DESC.\n");
	printf("  -I NN       Use ONLY 2 algorithms, NN and 0.\n");
	printf("  -U FILE     Use FILE to select download location.\n");
	printf("  -E CIPHER   Use CIPHER to encrypt data (LIST  lists available ciphers.)\n");
	printf("  file...     File(s) to (de)compress.  (If none given, use standard input).\n");
	return(0);
}

int dact_blksize_calc(int fsize) {
	if (fsize==0) return(DACT_BLK_SIZE_DEF);
	if (fsize<(204800)) {
		return(fsize+5);
	}
	return(((int) ((((float) fsize)/102400.0)-(0.9999999)))*65535);
}

int dact_upgrade_file(const char *name, const char *url_get, const char *url_ver, uint32_t version, const char *dest, const char *options) {
	int newver, ifd=-1, ofd=-1, x=-1;
	char *real_dest, *real_url_get, buf[4096];

	if (dest==NULL) {
		real_dest=parse_url_subst(DACT_BIN_DIR "@@FILE@@.so", name);
	} else {
		real_dest=parse_url_subst(dest, name);
	}
	real_url_get=parse_url_subst(url_get, name);

	newver=dact_upgrade_file_checkver(name, url_ver, options);
	if (newver>version) {
		if (options[DACT_OPT_UPGRADE]) {
			fprintf(stderr, "There is a new version of %s.  NEW: %i.%i.%i, CURR: %i.%i.%i, fetching...\n", name, DACT_VER_PARTS(newver), DACT_VER_PARTS(version));
			if ((ifd=open_net(real_url_get, O_RDONLY, 0))>=0) {
				if ((ofd=open_net(real_dest, O_WRONLY|O_CREAT|O_TRUNC, S_IRWXU))>=0) {
					while ((x=read(ifd, buf, sizeof(buf)))>0) {
						write(ofd, buf, x);
					}
					close(ifd);
					close(ofd);
					if (x<0) PERROR("read");
				} else {
					PERROR_L(ofd, "open");
				}
			} else {
				PERROR_L(ifd, "open");
			}
		} else {
			fprintf(stderr, "There is a new version of %s.  NEW: %i.%i.%i, CURR: %i.%i.%i\n", name, DACT_VER_PARTS(newver), DACT_VER_PARTS(version));
		}
	}
	free(real_dest);
	free(real_url_get);
	return(x);
}

int dact_upgrade_file_checkver(const char *name, const char *url_ver, const char *options) {
#ifdef CHECK_VERSION
	uint32_t rem_ver[4]={0, 0, 0, 0};
	int fd;
	char rem_vers[3][4]={{0,0,0,0},{0,0,0,0},{0,0,0,0}};
	char *urlbuf, verbuf[9];

	if (options[DACT_OPT_VERCHK]==0 && options[DACT_OPT_UPGRADE]==0) return(0);

	urlbuf=parse_url_subst(url_ver, name);
	if ((fd=open_net(urlbuf, O_RDONLY, 0))>=0) {
		read(fd, &verbuf, 9);
		close(fd);
		memcpy(rem_vers[0], verbuf, 3);
		memcpy(rem_vers[1], verbuf+3, 3);
		memcpy(rem_vers[2], verbuf+6, 3);
		rem_ver[0]=atoi(rem_vers[0]);
		rem_ver[1]=atoi(rem_vers[1]);
		rem_ver[2]=atoi(rem_vers[2]);
		rem_ver[3]=(rem_ver[0]<<16)|(rem_ver[1]<<8)|(rem_ver[2]);
	}
	free(urlbuf);
	return(rem_ver[3]);
#else
	return(0);
#endif
}

int dact_upgrade(char *options) {
#ifdef DACT_DEBIAN_UPGRADE_PROC
	char *buf;
	int status=0, i;

	if (getuid()==0) {
		buf=dact_ui_getuserinput("Executing `apt-get update' okay [y/N]? ", 5, 0);
		if (toupper(buf[0])!='Y') {
			PRINTERR("Failed to upgrade DACT.");
			free(buf);
			return(-1);
		}
		free(buf);

		if (fork()==0) {
			execl("/usr/bin/apt-get","apt-get","update",NULL);
			return(-1);  /* Couldn't run binary. */
		} else {
			i=wait(&status);
			if (WIFEXITED(status)) {
				if (WEXITSTATUS(status)) {
					PRINTERR("Failed to run `apt-get update'");
					return(-1);
				}
			}
		}

		if (fork()==0) {
			execl("/usr/bin/apt-get","apt-get","install","dact",NULL);
			return(-1);  /* Couldn't run binary. */
		} else {
			i=wait(&status);
			if (WIFEXITED(status)) {
				if (WEXITSTATUS(status)) {
					PRINTERR("Failed to run `apt-get install dact'");
					return(-1);
				}
			}
		}

		return(1);
	}
#else
	options[DACT_OPT_UPGRADE]=1;
	return(dact_upgrade_file("dact", DACT_BIN_URL, DACT_BIN_URL_VER, DACT_BIN_VER, DACT_BIN, options));
#endif
}

#if 0
int dact_upgrade(const char *options, uint32_t *crcs) {
	char *urlsubst, *buf, *dact_binfilebuf;
	char dact_binfile[256];
	int inFd, outFd;
	uint32_t i;


#ifdef DACT_DEBIAN_UPGRADE_PROC
	int status=0;

	if (getuid()==0) {
		buf=dact_ui_getuserinput("Executing `apt-get update' okay [y/N]? ", 5, 0);
		if (toupper(buf[0])!='Y') {
			PRINTERR("Failed to upgrade DACT.");
			free(buf);
			return(-1);
		}
		free(buf);

#ifdef WIN32
#error "Windows has no fork(), CreateProcess() instead"
#endif
		if (fork()==0) {
			execl("/usr/bin/apt-get","apt-get","update",NULL);
			return(-1);  /* Couldn't run binary. */
		} else {
			i=wait(&status);
			if (WIFEXITED(status)) {
				if (WEXITSTATUS(status)) {
					PRINTERR("Failed to run `apt-get update'");
					return(-1);
				}
			}
		}

		if (fork()==0) {
			execl("/usr/bin/apt-get","apt-get","install","dact",NULL);
			return(-1);  /* Couldn't run binary. */
		} else {
			i=wait(&status);
			if (WIFEXITED(status)) {
				if (WEXITSTATUS(status)) {
					PRINTERR("Failed to run `apt-get install dact'");
					return(-1);
				}
			}
		}

		return(1);
	}
#endif

	if ((i=is_latest(options))) {
		PRINTERR("**+");
		PRINT_LINE; fprintf(stderr, "dact: **> CURR: DACT %i.%i.%i\n",DACT_VER_MAJOR, DACT_VER_MINOR, DACT_VER_REVISION);
		PRINT_LINE; fprintf(stderr, "dact: **> NEW:  DACT %i.%i.%i\n",i>>16,(i>>8)&0xff,i&0xff);
		PRINTERR("**>");
		PRINTERR("**-");
	}
	if ((inFd=open_net("http://www.rkeene.org/projects/rget/rget.cgi?project=dact&file=info", O_RDONLY))>=0) {
		fprintf(stderr, "------------------------\n");
		buf=malloc(1024);
		while (1) {
			i=read_f(inFd, buf, 1024);
			write(STDERR_FILENO, buf, i);
			if (i!=1024) break;
		}
		fprintf(stderr, "------------------------\n");
		close(inFd);
		free(buf);
	}

#ifdef GO32
	mkdir("c:/dact/", 0755);
	strcpy(dact_binfile,"c:/dact/dact.exe");
#else
	strncpy(dact_binfile,getenv("HOME"),sizeof(dact_binfile)-1);
	strncat(dact_binfile,"/.dact/",sizeof(dact_binfile)-strlen(dact_binfile)-1);
	mkdir(dact_binfile, 0755);
	dact_binfilebuf=parse_url_subst("@@OSNM@@-@@ARCH@@/", "");
	strncat(dact_binfile,dact_binfilebuf,sizeof(dact_binfile)-strlen(dact_binfile)-1);
	free(dact_binfilebuf);
	mkdir(dact_binfile, 0755);
	
	strncat(dact_binfile,"dact.bin",sizeof(dact_binfile)-strlen(dact_binfile)-1);
#endif
	urlsubst=parse_url_subst("http://www.rkeene.org/projects/rget/rget.cgi?os=@@OSNM@@&arch=@@ARCH@@&project=dact&file=bin&meth=gz","");
	if ((outFd=open_net(dact_binfile, O_WRONLY|O_TRUNC|O_CREAT, 0755))<0) {
		PERROR_L(outFd, "open_net");
		return(-1);
	}
	if ((inFd=open_net(urlsubst, O_RDONLY, 0))<0) {
		PERROR_L(inFd, "open_net");
		return(-1);
	}
	if (!dact_process_file(inFd, outFd, DACT_MODE_DECMP, options, "dact", crcs,-1)) {
		close(inFd);
		close(outFd);
		unlink(dact_binfile);
		PRINTERR("Failed to upgrade DACT.");
		return(-1);
	}
	close(inFd);
	close(outFd);
	if (!options[DACT_OPT_BINCHK]) {
		PRINTERR("Note: You do not have binary_check  set to `on' in your dact.conf.");
	}
	return(1);
}

uint32_t is_latest (const char *options) {
#if defined(CHECK_VERSION)
	int fd;
	char ver_maj[4]={0,0,0,0}, ver_min[4]={0,0,0,0}, ver_rev[4]={0,0,0,0};
	char bigbuf[1024];
	int vers[3];

	if (options[DACT_OPT_VERCHK]==0) return(0);
	if (getuid()==0) return(0);

	if ((fd=createconnection_tcp("www.rkeene.org", 80))<0) return(0);

	write(fd, "GET http://www.rkeene.org/devel/dact/VERSION\n", 45);
	read(fd, &bigbuf,1024);

	memcpy(ver_maj,bigbuf,3);
	memcpy(ver_min,bigbuf+3,3);
	memcpy(ver_rev,bigbuf+6,3);

	closeconnection(fd);

	vers[0]=atoi(ver_maj);
	vers[1]=atoi(ver_min);
	vers[2]=atoi(ver_rev);

	if ( ((vers[0]<<16)|(vers[1]<<8)|vers[2]) > ((DACT_VER_MAJOR<<16)|(DACT_VER_MINOR<<8)|DACT_VER_REVISION) ) {
		return((vers[0]<<16)|(vers[1]<<8)|vers[2]);
	} else {
		return(0);
	}
#else
	return(0);
#endif
}
#endif

int dact_shutdown(int retval) {
	unload_modules();
	dact_ui_deinit();
	return(retval);
}

char *dact_getoutfilename(const char *orig, const int mode) {
	char *ret=NULL;
	int x=0;

	switch (mode) {
		case DACT_MODE_COMPR:
			ret=malloc(strlen(orig)+5);
#ifdef GO32
			strncpy(ret,orig,8);
			for (x=0;x<strlen(ret);x++) {
				if (ret[x]=='.') ret[x]='_';
			}
			strcat(ret,".dct");
#else
			strcpy(ret,orig);
			strcat(ret,".dct");
#endif
			break;
		case DACT_MODE_DECMP:
			if (strcmp(&orig[strlen(orig)-4],".dct") && \
				strcmp(&orig[strlen(orig)-4], ".bz2") && \
				strcmp(&orig[strlen(orig)-5], ".tbz2") && \
				strcmp(&orig[strlen(orig)-4], ".tgz") && \
				strcmp(&orig[strlen(orig)-3], ".gz")) {
				return(NULL);
			}
/* XXX: I wonder if this breaks easily... */
			x=(strrchr(orig,'.')-orig);
			ret=malloc(x+1);
			strncpy(ret,orig,x);
			ret[x]=0;
			break;
		case DACT_MODE_STAT:
			return(NULL);
			break;
	}
	return(ret);
}

uint32_t dact_process_other(int src, const int dest, const uint32_t magic, const char *options) {
	char *buf, tmpbuf[128]="/tmp/dactXXXXXX";
	uint32_t filesize=0, x;
	int tmpfd=0;
#if defined(HAVE_LIBBZ2) && (defined(HAVE_BZDOPEN) || defined(HAVE_NEW_BZDOPEN))
	BZFILE *bzfd;
#endif
#if defined(HAVE_LIBZ) && defined(HAVE_GZDOPEN)
	gzFile gzfd;
#endif

	filesize=0;  /* Fix a warning, that is all. */

/*
 * bad and broke stuff XXX FIXME XXX FIXME XXX FIXME
 * There has to be a better way to do this... I just want
 * to rewind my socket/pipe 4 bytes... 4 bytes is all I ask
 * Is that so much to ask for?  Well?!  Is it?!  I don't
 * think it is.
 * I give up on this.
 *
 * Someone please fix it.
 *  -- Roy Keene <dact@rkeene.org>
 */
	if (lseek_net(src, 0, SEEK_SET)<0) {
		PRINTERR("This should not be happening.");
/*
 * lseek_net() should make this obsolete.
 *  ... EXCEPT! when reading from stdin.
 *
 */
		tmpfd=mkstemp(tmpbuf);
		write_de(tmpfd, magic, 4);
		buf=malloc(1024);
		while (1) {
			x=read_f(src, buf, 1024);
			write(tmpfd, buf, x);
			if (x<1024) break;
		}
		close(src);
		src=tmpfd;
		lseek_net(src, 0, SEEK_SET); /* Now bitch. */
		free(buf);
	}
#if defined(HAVE_LIBZ) && defined(HAVE_GZDOPEN)


	if ((magic&0xffff0000)==0x1f8b0000) { /* gzip */
		dact_ui_status(DACT_UI_LVL_GEN, "Gunzipping...");
		buf=malloc(1024);

		gzfd=gzdopen(src, "r");
/*XXX: need to dact_ui_setup() */
		while (1) {
			dact_ui_incrblkcnt(1);
			x=gzread(gzfd,buf,1024);
			filesize+=write(dest, buf, x);
			if (x<1024) break;
		}
		free(buf);
		if (tmpfd!=0) unlink(tmpbuf);
		return(filesize);
	}
#endif

#if defined(HAVE_LIBBZ2) && (defined(HAVE_BZDOPEN) || defined(HAVE_NEW_BZDOPEN))
	if ((magic&0xffffff00)==0x425a6800) { /* bzip2 */ 
		dact_ui_status(DACT_UI_LVL_GEN, "Bunzipping...");
		buf=malloc(1024);

#ifdef HAVE_NEW_BZDOPEN
		bzfd=BZ2_bzdopen(src, "r");
#else
		bzfd=bzdopen(src, "r");
#endif
/*XXX: need to dact_ui_setup() */
		while(1) {
			dact_ui_incrblkcnt(1);
#ifdef HAVE_NEW_BZDOPEN
			x=BZ2_bzread(bzfd, buf, 1024);
#else
			x=bzread(bzfd, buf, 1024);
#endif
			filesize+=write(dest, buf, x);
			if (x<1024) break;
		}
		free(buf);
		if (tmpfd!=0) unlink(tmpbuf);
		return(filesize);
	}
#endif
	return(0);
}

int main(int argc, char **argv) {
	unsigned char options[20]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
	signed char opt;
	struct stat stat_buf;
	char **in_files, *in_file=NULL, *out_file=NULL;
	char dact_binfilebuf[256], *dact_binfile;
	int filecnt=0;
	int in_fd, out_fd;
	int mode=DACT_MODE_COMPR, ciphernum=-1;
	uint32_t crcs[6]={0,0,0,0,0,0};
	uint32_t i,x;


	dact_ui_init();


/* hack, to make upgrade work even if DACT_OPT_BINCHK is enabled, we must
 *      get the new version before executing it.
 */
	if (argv[1]!=NULL) {
		if (!strcmp(argv[1],"-N")) return(dact_upgrade(options));
		if (!strcmp(argv[1],"-a")) options[DACT_OPT_UPGRADE]=1;
	}

	dact_config_loadfile(DACT_CONFIG_FILE, options);
#if !defined(GO32) && !defined(__WIN32__)
	dact_binfilebuf[0]='\0';
	if (getenv("HOME")) {
		strncpy(dact_binfilebuf,getenv("HOME"),sizeof(dact_binfilebuf)-1);
	}
	strncat(dact_binfilebuf,"/.dact/dact.conf",sizeof(dact_binfilebuf)-strlen(dact_binfilebuf)-1);
	dact_config_loadfile(dact_binfilebuf, options);
#endif

	if (options[DACT_OPT_BINCHK]) {
		dact_binfile=parse_url_subst(DACT_BIN, "");
		if (strcmp(argv[0],dact_binfile)) {
			if (!access(dact_binfile,X_OK)) {
				argv[0]=dact_binfile;
#ifndef __MINGW32__
				execv(dact_binfile, argv);
#else
				execv(dact_binfile, (const char **) argv);
#endif
			}
		}
	}

	while ((opt=getopt(argc,argv,"adfsvcnhiNVHCM:E:p:I:m:e:lb:u:U:TPOD:o:"))!=-1) {
		switch (opt) {
			case 'a':
				options[DACT_OPT_UPGRADE]=1;
				break;
			case 'd':
				mode=DACT_MODE_DECMP;
				break;
			case 'f':
				options[DACT_OPT_FORCE]++;
				break;
			case 's':
				mode=DACT_MODE_STAT;
				break;
			case 'i':
				dact_ui_setopt(DACT_UI_OPT_PASSSTDIN, 1);
				break;
			case 'c':
				options[DACT_OPT_STDOUT]=!options[DACT_OPT_STDOUT];
				break;
			case 'b':
				i=atoi2(optarg);
				if (i<DACT_BLK_SIZE_MAX) DACT_BLK_SIZE=i;
				break;
			case 'v':
				options[DACT_OPT_VERB]++;
				dact_ui_setopt(DACT_UI_OPT_LEVEL,dact_ui_getopt(DACT_UI_OPT_LEVEL)+1);
				break;
			case 'n':
				options[DACT_OPT_NOCRC]=!options[DACT_OPT_NOCRC];
				break;
			case 'p':
				PRINT_LINE; fprintf(stderr, "dact: %s\n",parse_url_subst(optarg,"@@file@@"));
				mode=DACT_MODE_RET;
				break;
			case 'C':
				options[DACT_OPT_COMPLN]++;
				break;
			case 'm':
				dact_config_loadfile(optarg, options);
				break;
			case 'e':
				i=(atoi(optarg)&0xff);
				algorithms[i]=DACT_FAILED_ALGO;
				break;
			case 'H':
				options[DACT_OPT_HDONLY]=!options[DACT_OPT_HDONLY];
				break;
			case 'o':
				out_file=parse_url_subst(optarg, "");
				break;
			case 'M':
				dact_config_execute(optarg, options);
				break;
			case 'N':
				PRINTERR("The `-N\' option must be the first and only argument passed to dact.");
				return(0);
				break;
			case 'E':
				strtolower(optarg);
				x=hash_fourbyte(optarg, ' ');
				if (x==hash_fourbyte("list", ' ')) {
					PRINT_LINE; fprintf(stderr, "dact: Num | Name\n");
					for (i=0;i<CIPHER_COUNT;i++) {
						if (ciphers_name[i]!=NULL && ciphers[i]!=DACT_FAILED_ALGO) {
							PRINT_LINE; fprintf(stderr, "dact: %3i | %s\n",i,ciphers_name[i]);
						}
					}
					return(0);
				}
				for (i=0;i<CIPHER_COUNT;i++) {
					if (ciphers_name[i]!=NULL && ciphers[i]!=DACT_FAILED_ALGO) {
						if (x==hash_fourbyte(ciphers_name[i], ' ')) {
							break;
						}
					}
				}
				if (i==CIPHER_COUNT) i=-1;
				ciphernum=i;
				if (ciphernum==-1) {
					PRINTERR("No such cipher.");
					return(-1);
				}
				break;
			case 'l':
				PRINT_LINE; fprintf(stderr, "dact: Num | Name\n");
				for (i=0;i<255;i++) {
					if (algorithms[i]==NULL || algorithms[i]==DACT_FAILED_ALGO) continue;
					PRINT_LINE; fprintf(stderr, "dact: %3i | %s\n",i,algorithm_names[i]);
			
				}
				mode=DACT_MODE_RET;
				break;
			case 'I':
				x=atoi(optarg);
				for (i=1;i<255;i++) {
					if (i!=x) algorithms[i]=NULL;
				}
				break;
			case 'V':
				printf("DACT %i.%i.%i-%s", DACT_VER_MAJOR, DACT_VER_MINOR, DACT_VER_REVISION, DACT_VER_SUB);
#if defined(__DATE__) && defined(__TIME__)
				printf("  built on %s at %s",__DATE__,__TIME__);
#endif
#ifdef DACT_CONTACT
				printf(" %s",DACT_CONTACT);
#endif
				printf("\n");
				return(0);
				break;
			case 'u':
				dact_hdr_ext_regs(DACT_HDR_URL, optarg, strlen(optarg));
				break;
			case 'U':
				dact_hdr_ext_regs(DACT_HDR_URLFILE, optarg, strlen(optarg));
				break;
			case 'D':
				dact_hdr_ext_regs(DACT_HDR_DESC, optarg, strlen(optarg));
				break;
			case 'T':
				options[DACT_OPT_TIME]=!options[DACT_OPT_TIME];
				break;
			case 'P':
				options[DACT_OPT_PERM]=!options[DACT_OPT_PERM];
				break;
			case 'O':
				options[DACT_OPT_ORIG]=!options[DACT_OPT_ORIG];
				break;
			case 'S':
				options[DACT_OPT_SZSPD]=!options[DACT_OPT_SZSPD];
				break;
			case '?':
			case ':':
			case 'h':
				return(print_help(argc,argv));
		}

	}

/* 
 * Check for a new version of DACT 
 */
	if ((i=dact_upgrade_file_checkver("dact", DACT_BIN_URL_VER, options))>DACT_BIN_VER) {
		PRINTERR("**+");
		PRINTERR("**> There is a new version of DACT available.");
		PRINTERR("**>");
		PRINT_LINE; fprintf(stderr, "dact: **> [CURR: DACT %i.%i.%i]\n",DACT_VER_MAJOR, DACT_VER_MINOR, DACT_VER_REVISION);
		PRINT_LINE; fprintf(stderr, "dact: **> [NEW:  DACT %i.%i.%i]\n",i>>16,(i>>8)&0xff,i&0xff);
		PRINTERR("**>");
		PRINTERR("**> Run `dact -N' to get it.");
		PRINTERR("**> or get the source at: http://www.rkeene.org/devel/dact.tar.gz");
		PRINTERR("**>");
		PRINTERR("**-");
	}

	if (mode==DACT_MODE_RET) return(0);

	in_files=&argv[optind];

/* Loop through extra parameters (files ...) and setup FDs for them */
	do {
		in_fd=-1;
		out_fd=-1;

		in_file=in_files[filecnt];
		if (in_file!=NULL) {
/* Determine resulting file name */
			if (out_file==NULL) out_file=dact_getoutfilename(in_file,mode);
			if (!strcmp("-",in_file)) {
				in_fd=STDIN_FILENO;
			} else {
				stat(in_file, &stat_buf);
				if (S_ISDIR(stat_buf.st_mode)) {
					fprintf(stderr, "dact: %s is a directory.",in_file);
					continue;
				}
				if ((in_fd=open_net(in_file, O_RDONLY, 0))<0) {
					fprintf(stderr, "dact: Can't open %s.\n",in_file);
					PERROR_L(in_fd, "open");
					continue;
				}
			}
			if (out_file!=NULL) {
				if (!strcmp("-",out_file)) options[DACT_OPT_STDOUT]=1;
/*
 *
 * This is a bad thing if this program is SUID root, which it NEVER EVER 
 * should be.
 *
 *  DO NOT MAKE DACT SUID ROOT OR YOU WILL BE HACKED
 * 
 * that should be a suffcient warning.
 * (this is a mere race condition, but a severe warning should prevent
 *  people from complaining about it to me.)
 *
 */
				if (access(out_file,F_OK)!=-1 && options[DACT_OPT_FORCE]==0 && options[DACT_OPT_STDOUT]==0) {
					fprintf(stderr, "dact: %s exists.\n",out_file);
					close(in_fd);
					continue;
				}
				if (!options[DACT_OPT_STDOUT]) {
					if ((out_fd=open_net(out_file,O_WRONLY|O_CREAT|O_TRUNC,0644))<0) {
						fprintf(stderr, "dact: Can't open %s for writing.\n",out_file);
						PERROR_L(out_fd, "open");
						continue;
					}
				}
			}
			if (options[DACT_OPT_STDOUT]) out_fd=STDOUT_FILENO;
		}

/* Use STDIN/STDOUT if no files specified ... unless an outfile was specified... */
		if (in_file==NULL && filecnt==0) {
/* ... But only if STDOUT isn't a terminal */
			if (isatty(STDOUT_FILENO) && options[DACT_OPT_FORCE]==0) {
				fprintf(stderr, "dact: Refusing to write compressed output to a terminal.\n");
			} else {
				out_fd=STDOUT_FILENO;
				in_fd=STDIN_FILENO;
			}
		}

/* Okay, we're all done, now pass these to something to do the real stuff */
		if (in_fd!=-1 && (out_fd!=-1 || mode==DACT_MODE_STAT)) {
			crcs[1]=crcs[0]=0;
			if (dact_process_file(in_fd, out_fd, mode, options, in_file, crcs, ciphernum)==0) {
				close(in_fd);
				close(out_fd);
				if (out_fd!=STDOUT_FILENO) {
					unlink(out_file);
				}
				return(dact_shutdown(-1));
			}
		}
/* Cleanup */
		if (out_fd!=-1) close(out_fd);
		if (in_fd!=-1) close(in_fd);
	} while (in_files[filecnt++]!=NULL);

	return(dact_shutdown(0));
}