Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!tut.cis.ohio-state.edu!brutus.cs.uiuc.edu!usc!henry.jpl.nasa.gov!elroy.jpl.nasa.gov!peregrine!ccicpg!conexch!sandy
From: sandy@conexch.UUCP (Sandford Zelkovitz)
Newsgroups: alt.sources
Subject: uncmp103 part 2 of 2
Keywords: uncmp103 part_2of_2
Message-ID: <37271@conexch.UUCP>
Date: 20 Sep 89 01:56:27 GMT
Organization: The Consultants' Exchange, Orange County, CA
Lines: 492

This is part 2 of 2 ------- uncmp103 for Xenix

--------------------- cut here for part 2 of 2 -----------------------

#!/bin/sh
# to extract, remove the header and type "sh filename"
if `test ! -s ./Makefile`
then
echo "writing ./Makefile"
cat > ./Makefile << '\Rogue\Monster\'
####################################################################
# UNCMP - MAKEFILE, Version 1.03, created 6-28-89
#
# Microsoft makefile for creating UNCMP v1.03.
#
# This files using another file named LINK.LST to give to LINK
# because the number of files is too large for LINK to handle from
# the command line.
#
# This code has been released into the Public Domain.
####################################################################

C_OPTS = -c -O
CDEFS =
HDRS = global.h archead.h dlzw1213.h uncmp.h
SRCS = uncmp.c crc.c fileio.c global.c dispatch.c dlzw1213.c \
    huffman.c slzw12.c listarc.c gethead.c filelist.c stubs.c \
    store.c errors.c pack.c testarc.c
OBJS = uncmp.o crc.o fileio.o global.o dispatch.o \
    dlzw1213.o huffman.o slzw12.o testarc.o listarc.o \
    gethead.o filelist.o stubs.o store.o errors.o pack.o


uncmp:    $(OBJS) $(SRCS) $(HDRS)
	$(CC) $(OBJS) -o uncmp
uncmp.o:    uncmp.c global.h archead.h uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) uncmp.c
crc.o:      crc.c global.h archead.h uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) crc.c
fileio.o:   fileio.c global.h archead.h uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) fileio.c
global.o:   global.c global.h archead.h uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) global.c
dispatch.o: dispatch.c global.h archead.h uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) dispatch.c
listarc.o:  listarc.c global.h archead.h
	$(CC) $(C_OPTS) $(CDEFS) listarc.c
testarc.o:  testarc.c global.h global.c
	$(CC) $(C_OPTS) $(CDEFS) testarc.c
dlzw1213.o: dlzw1213.c global.h archead.h uncmp.h dlzw1213.h
	$(CC) $(C_OPTS) $(CDEFS) dlzw1213.c
slzw12.o:   slzw12.c
	$(CC) $(C_OPTS) $(CDEFS) slzw12.c
huffman.o:  huffman.c global.h archead.h
	$(CC) $(C_OPTS) $(CDEFS) huffman.c
gethead.o:  gethead.c global.h archead.h
	$(CC) $(C_OPTS) $(CDEFS) gethead.c
filelist.o: filelist.c uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) filelist.c
stubs.o:    stubs.c
	$(CC) $(C_OPTS) $(CDEFS) stubs.c
store.o:    store.c uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) store.c
errors.o:   errors.c uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) errors.c
pack.o:     pack.c uncmp.h
	$(CC) $(C_OPTS) $(CDEFS) pack.c
\Rogue\Monster\
else
  echo "will not over write ./Makefile"
fi
if `test ! -s ./archead.h`
then
echo "writing ./archead.h"
cat > ./archead.h << '\Rogue\Monster\'
/*******************************************************************
* UNCMP - ARCHEAD.H, Version 1.03, created 6-28-89
*
* Definition of archive header structure.
*
* This code has been released into the Public Domain.
*******************************************************************/

#pragma pack(1)

struct archive_header {
    char            arcmark; /* arc mark = 0x1a */
    char            atype;   /* header version 0 = end, else pack
                              * method */
    char            name[13];/* file name */
    unsigned long   size;    /* size of compressed file */
    short           date;    /* file date */
    short           time;    /* file time */
    unsigned short  crc;     /* cyclic redundancy check */
    unsigned long   length;  /* true file length */
};                           /* the next size bytes after the header */
#pragma pack()
\Rogue\Monster\
else
  echo "will not over write ./archead.h"
fi
if `test ! -s ./crc.c`
then
echo "writing ./crc.c"
cat > ./crc.c << '\Rogue\Monster\'
/*******************************************************************
* UNCMP - CRC, Version 1.03, created 6-28-89
*
* 16 bit CRC calculator.
*
* Calculates the CRC of a block of data using a fast table driven
* algorithm.
*
* This code came from SQUASH.C by Leslie Satensten, which was taken
* from an article by David Schwaderer in the April 1985 issue of
* PC Tech Journal, and is thus in the Public Domain.
*
* This code has been released into the Public Domain.
*******************************************************************/

#include <stdio.h>
#include "archead.h"
#include "global.h"
#include "uncmp.h"

int crctab[] =               /* CRC lookup table */
{
    0x0000, 0xC0C1, 0xC181, 0x0140, 0xC301, 0x03C0, 0x0280, 0xC241,
    0xC601, 0x06C0, 0x0780, 0xC741, 0x0500, 0xC5C1, 0xC481, 0x0440,
    0xCC01, 0x0CC0, 0x0D80, 0xCD41, 0x0F00, 0xCFC1, 0xCE81, 0x0E40,
    0x0A00, 0xCAC1, 0xCB81, 0x0B40, 0xC901, 0x09C0, 0x0880, 0xC841,
    0xD801, 0x18C0, 0x1980, 0xD941, 0x1B00, 0xDBC1, 0xDA81, 0x1A40,
    0x1E00, 0xDEC1, 0xDF81, 0x1F40, 0xDD01, 0x1DC0, 0x1C80, 0xDC41,
    0x1400, 0xD4C1, 0xD581, 0x1540, 0xD701, 0x17C0, 0x1680, 0xD641,
    0xD201, 0x12C0, 0x1380, 0xD341, 0x1100, 0xD1C1, 0xD081, 0x1040,
    0xF001, 0x30C0, 0x3180, 0xF141, 0x3300, 0xF3C1, 0xF281, 0x3240,
    0x3600, 0xF6C1, 0xF781, 0x3740, 0xF501, 0x35C0, 0x3480, 0xF441,
    0x3C00, 0xFCC1, 0xFD81, 0x3D40, 0xFF01, 0x3FC0, 0x3E80, 0xFE41,
    0xFA01, 0x3AC0, 0x3B80, 0xFB41, 0x3900, 0xF9C1, 0xF881, 0x3840,
    0x2800, 0xE8C1, 0xE981, 0x2940, 0xEB01, 0x2BC0, 0x2A80, 0xEA41,
    0xEE01, 0x2EC0, 0x2F80, 0xEF41, 0x2D00, 0xEDC1, 0xEC81, 0x2C40,
    0xE401, 0x24C0, 0x2580, 0xE541, 0x2700, 0xE7C1, 0xE681, 0x2640,
    0x2200, 0xE2C1, 0xE381, 0x2340, 0xE101, 0x21C0, 0x2080, 0xE041,
    0xA001, 0x60C0, 0x6180, 0xA141, 0x6300, 0xA3C1, 0xA281, 0x6240,
    0x6600, 0xA6C1, 0xA781, 0x6740, 0xA501, 0x65C0, 0x6480, 0xA441,
    0x6C00, 0xACC1, 0xAD81, 0x6D40, 0xAF01, 0x6FC0, 0x6E80, 0xAE41,
    0xAA01, 0x6AC0, 0x6B80, 0xAB41, 0x6900, 0xA9C1, 0xA881, 0x6840,
    0x7800, 0xB8C1, 0xB981, 0x7940, 0xBB01, 0x7BC0, 0x7A80, 0xBA41,
    0xBE01, 0x7EC0, 0x7F80, 0xBF41, 0x7D00, 0xBDC1, 0xBC81, 0x7C40,
    0xB401, 0x74C0, 0x7580, 0xB541, 0x7700, 0xB7C1, 0xB681, 0x7640,
    0x7200, 0xB2C1, 0xB381, 0x7340, 0xB101, 0x71C0, 0x7080, 0xB041,
    0x5000, 0x90C1, 0x9181, 0x5140, 0x9301, 0x53C0, 0x5280, 0x9241,
    0x9601, 0x56C0, 0x5780, 0x9741, 0x5500, 0x95C1, 0x9481, 0x5440,
    0x9C01, 0x5CC0, 0x5D80, 0x9D41, 0x5F00, 0x9FC1, 0x9E81, 0x5E40,
    0x5A00, 0x9AC1, 0x9B81, 0x5B40, 0x9901, 0x59C0, 0x5880, 0x9841,
    0x8801, 0x48C0, 0x4980, 0x8941, 0x4B00, 0x8BC1, 0x8A81, 0x4A40,
    0x4E00, 0x8EC1, 0x8F81, 0x4F40, 0x8D01, 0x4DC0, 0x4C80, 0x8C41,
    0x4400, 0x84C1, 0x8581, 0x4540, 0x8701, 0x47C0, 0x4680, 0x8641,
    0x8201, 0x42C0, 0x4380, 0x8341, 0x4100, 0x81C1, 0x8081, 0x4040
};

void addcrc(char *cc, int i)
{
    for (cc--; i--;)
         crc = ((crc >> 8) & 0x00ff) ^ crctab[(crc ^ *++cc) & 0x00ff];
}

\Rogue\Monster\
else
  echo "will not over write ./crc.c"
fi
if `test ! -s ./dispatch.c`
then
echo "writing ./dispatch.c"
cat > ./dispatch.c << '\Rogue\Monster\'
/*******************************************************************
* UNCMP - DISPATCH, Version 1.03, created 6-28-89
*
* Uncompresses files by compression type.
*
* Determines archive uncompression method from archive header.
*
* This code has been released into the Public Domain.
*******************************************************************/

#include <stdio.h>
#include <stdlib.h>
#include "archead.h"
#include "global.h"
#include "uncmp.h"

int uncmp(FILE *in, FILE *out)
{
    crc = 0;
    sizeleft = archead.size;
    state = 0;          /* set to NOHIST for rle packing */

    switch(archead.atype) {
         case 1:
         case 2:
              if (archead.atype == 1) printf("Unstoring,    ");
              else printf("UnStoring,    ");
              store_decomp(in,out);
              break;
         case 3:
              printf("UnPacking,    ");
              rle_decomp(in,out);
              break;
         case 4:
              printf("UnSqueezing,  ");
              sq_decomp(in,out);
              break;
         case 5:
         case 6:
         case 7:
              printf("Uncrunching,  ");
              slzw_decomp(in,out,archead.atype);
              break;
         case 8:
         case 9:
              if (archead.atype == 8) printf("UnCrunching,  ");
              else printf("UnSquashing,  ");
              dlzw_decomp(in,out,archead.atype,archead.size);
              break;
         case 10:
              if (warning) printf("\nCrushing not supported in this version of UNCMP, skipping\n");
              fseek(in,archead.size,1);
              return(1);
         default:
              if (warning) {
                   printf("\nFile uses unknown compression type,\n");
                   printf("I think you need a newer version of UNCMP\n");
              }
              fseek(in,archead.size,1);
              errors++;
              return (1);
         }

    fflush(out);
    if (ferror(out)) {
         printf("\nError writing file\nPossible disk full?\n");
         exit(1);
         }

    printf("Done\n");
    if (crc != archead.crc) {
         if (warning) printf("File %s failed CRC check (CRC %04X)\n",archead.name,crc);
         errors++;
         return (1);
         }
    return (0);
    }
\Rogue\Monster\
else
  echo "will not over write ./dispatch.c"
fi
if `test ! -s ./dlzw1213.c`
then
echo "writing ./dlzw1213.c"
cat > ./dlzw1213.c << '\Rogue\Monster\'
/*******************************************************************
* UNCMP - DLZW1213, Version 1.03, created 6-28-89
*
* Dynamic Lempel-Ziv-Welch 12/13 bit uncompression module.
*
* Uncompresses files stored with Crunching (LZW 9-12 bits with RLE
* coding) and Squashing (LZW 9-13).  The basic compression algorithm
* is FC-SWAP (See Storer, James A., _Data Compression Method and
* Theory_, 1989, Computer Science Press).
*
* The great majority of this code came from SQUASH.C by Leslie
* Satensten, which was based on the Unix COMPRESS program which is
* in the Public Domain.
*
* This code has been released into the Public Domain.
*******************************************************************/

#include <stdio.h>
#include <ctype.h>
#include <signal.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <stdlib.h>
#include "dlzw1213.h"
#include "uncmp.h"
#include "archead.h"
#include "global.h"

long headerlength;

void decomp(FILE *,FILE *);  /* function only used by dlzw_decomp() */
int PASCAL getcode(FILE *);

unsigned char rmask[9] = {   /* for use with getcode() */
    0x00, 0x01, 0x03, 0x07, 0x0f, 0x1f, 0x3f, 0x7f, 0xff
    };

int PASCAL getcode(FILE *in)
{
    static char iobuf[BITS];
    register int code;
    static int offset = 0, size = 0;
    register int r_off, bits;
    register unsigned char *bp = iobuf;

    if (clear_flg > 0 || offset >= size || free_ent > maxcode) {

         /* If the next entry will be too big for the current code */
         /* size, then we must increase the size.  This implies */
         /* reading a new buffer full, too. */

         if (free_ent > maxcode) {              n_bits++;
              if (n_bits == max_bits)
                   maxcode = maxmaxcode;    /* won't get any bigger now */
              else
                   maxcode = MAXCODE(n_bits);
         }
         if (clear_flg > 0) {
              maxcode = MAXCODE(INIT_BITS);
              n_bits = INIT_BITS;
              clear_flg = 0;
         }
         for (size = 0; size < n_bits; size++) {
              if ((code = getc_pak(in)) == EOF)
                   break;
              else
                   iobuf[size] = code;
         }

         if (size <= 0)
              return -1;     /* end of file */

         offset = 0;

         /* Round size down to integral number of codes */

         size = (size << 3) - (n_bits - 1);
    }
    r_off = offset;
    bits = n_bits;

    /* Get to the first byte. */

    bp += (r_off >> 3);
    r_off &= 7;

    /* Get first part (low order bits) */

    code = (*bp++ >> r_off);
    bits -= (8 - r_off);
    r_off = 8 - r_off;  /* now, offset into code word */

    /* Get any 8 bit parts in the middle (<=1 for up to 16 bits). */

    if (bits >= 8) {
         code |= *bp++ << r_off;
         r_off += 8;
         bits -= 8;
    }

    /* high order bits. */

    code |= (*bp & rmask[bits]) << r_off;
    offset += n_bits;

    return code;
}

int dlzw_decomp(FILE *in, FILE *out, int arctype, long size)
{
    headertype = arctype;
    headerlength = size;

    if (headertype == 8) {           /* UnCrunch */
         hsize = 5003;

         /* every Crunched file must start with a byte equal to 12, */
         /* the maximum bit size of the pointer-length pair */

         if (12 != (max_bits = getc_pak(in))) {
              read_error();
         }
    } else {                      /* UnSquash */
         max_bits = BITS;
         hsize = 9001;
    }
    maxmaxcode = 1 << max_bits;
    decomp(out,in);
    return(0);
}

void decomp(FILE *out, FILE *in)
{
    register unsigned char *stackp;
    register int finchar;
    register int code, oldcode;
    int incode;

    /* As above, initialize the first 256 entries in the table */

    maxcode = MAXCODE(INIT_BITS);
    n_bits = INIT_BITS;

    /* why does the code run more slowly when the "(unsigned int) 0" is */
    /* removed? */

    for (code = 255; code >= 0; code--) {
         tab_suffixof(code) = (unsigned char) code | (unsigned int) 0;
    }
    free_ent = FIRST;
    incode = finchar = oldcode = getcode(in);
    if (oldcode == EOF)  /* EOF already? */
         return;         /* Get out of here */
    add1crc(incode);     /* calc the crc */

    if (headertype==8)
         lastc = (char) incode;

    fwrite((char *) &incode, sizeof(char), 1, out);   /* first code must be 8 */
                                                      /* bits = char */
    stackp = de_stack;

    while ((code = getcode(in)) > -1) {
         if (code == CLEAR) {
              for (code = 255; code >= 0; code--)
                   tab_prefixof(code) = 0;
              clear_flg = 1;
              free_ent = FIRST - 1;
              if ((code = getcode(in)) == -1) { /* O, untimely death! */
                   break;
              }
         }
         incode = code;

         /* Special case for KwKwK string */

         if (code >= free_ent) {
              *stackp++ = finchar;
              code = oldcode;
         }

         /* Generate output characters in reverse order Stop if input */
         /* code is in range 0..255 */

         while (code >= 256) {
              *stackp++ = tab_suffixof(code);
              code = tab_prefixof(code);
         }
         *stackp++ = finchar = tab_suffixof(code);

         /* the following code for headertype 9 used to use memrev() to */
         /* reverse the order and then output using fread.  The following */
         /* method was tested to be faster */

         /* characters are read in reverse order from the stack (like any */
         /* stack) and then output. */

         if (headertype == 9) {
              do
                   putc_pak(*--stackp, out);
              while (stackp > de_stack);
         } else {  /* headertype==8  */
              do
                   putc_rle(*--stackp, out);
              while (stackp > de_stack);
         }

         /* Generate the new entry */

         if ((code = free_ent) < maxmaxcode) {
              tab_prefixof(code) = (unsigned short) oldcode;
              tab_suffixof(code) = finchar;
              free_ent = code + 1;
         }

         /* Remember previous code */

         oldcode = incode;
    }
}

\Rogue\Monster\
else
  echo "will not over write ./dlzw1213.c"
fi
echo "Finished archive 2 of 2"
exit
-- 
uucp: ...!uunet!zardoz!alphacm!sandy   ....!att!hermix!alphacm!sandy
      ...!trwrb!ucla-an!alphacm!sandy  ....!lcc!alphacm!sandy
phone: data --- 714-821-9671     voice --- 714-821-9670
Sanford <sandy> Zelkovitz