/*
 *  arcmatch.c  1.1
 *
 *  Author: Thom Henderson
 *  Original System V port: Mike Stump
 *
 * REVISION HISTORY
 *
 * 03/22/87  C. Seaman      enhancements, bug fixes, cleanup
 * 11/13/89  C. Mascott     adapt for use with unzip
 * 01/25/90  J. Cowan       match case-insensitive
 * 03/17/90  D. Kirschbaum      Prototypes, other tweaks for Turbo C.
 *
 */

/*
 * ARC - Archive utility - ARCMATCH
 * 
 * Version 2.17, created on 12/17/85) at 20:32:18
 *
 * (C) COPYRIGHT 1985 by System Enhancement Associates; ALL RIGHTS RESERVED
 *
 *     Description:
 *        This file contains service routines needed to maintain an archive.
 */
#ifdef	AMIGA
#include <stdio.h>      /* for printf() */
#include <stdlib.h>     /* for exit() */
#include "unzip.h"
#include "zip_proto.i"
#else
#include <sys/types.h>
#include <sys/dir.h>
#endif
#include <ctype.h>

#ifdef __TURBOC__               /* v2.0b */
#include <stdio.h>      /* for printf() */
#include <stdlib.h>     /* for exit() */
#endif

#ifdef __TURBOC__              /* v2.0b */
/* local prototypes for Turbo */

int match(char *string, char *pattern);
BOOLEAN do_list (register char *string, char *pattern);  /* v2.0b */
void list_parse (char **patp, char *lowp, char *highp);
char nextch (char **patp);
#else       /* v2.0b original code */
BOOLEAN do_list();
char nextch();
void list_parse();
#endif

int match(string, pattern)
char *string;
char *pattern;
{
    register int ismatch;

    ismatch = FALSE;
    switch (*pattern)
    {
    case ASTERISK:
        pattern++;
        do
        {
            ismatch = match (string, pattern);
        }
        while (!ismatch && *string++ != EOS);
        break;
    case QUESTION:
        if (*string != EOS)
            ismatch = match (++string, ++pattern);
        break;
    case EOS:
        if (*string == EOS)
            ismatch = TRUE;
        break;
    case LEFT_BRACKET:
        if (*string != EOS)
            ismatch = do_list (string, pattern);
        break;
    case BACK_SLASH:
        pattern++;
    default:
    if (toupper(*string) == toupper(*pattern))
        {
            string++;
            pattern++;
            ismatch = match (string, pattern);
        }
        else
            ismatch = FALSE;
        break;
    }
    return(ismatch);
}

BOOLEAN do_list (string, pattern)
register char *string;
char *pattern;
{
    register BOOLEAN ismatch;
    register BOOLEAN if_found;
    register BOOLEAN if_not_found;
    auto char lower;
    auto char upper;

    pattern++;
    if (*pattern == '!')
    {
        if_found = FALSE;
        if_not_found = TRUE;
        pattern++;
    }
    else
    {
        if_found = TRUE;
        if_not_found = FALSE;
    }
    ismatch = if_not_found;
    while (*pattern != ']' && *pattern != EOS)
    {
        list_parse(&pattern, &lower, &upper);
        if (*string >= lower && *string <= upper)
        {
            ismatch = if_found;
            while (*pattern != ']' && *pattern != EOS) pattern++;
        }
    }

    if (*pattern++ != ']')
    {
        printf("Character class error\n");
        exit(1);
    }
    else
        if (ismatch)
            ismatch = match (++string, pattern);

    return(ismatch);
}

void list_parse (patp, lowp, highp)
char **patp;
char *lowp;
char *highp;
{
    *lowp = nextch (patp);
    if (**patp == '-')
    {
        (*patp)++;
        *highp = nextch(patp);
    }
    else
        *highp = *lowp;
}

char nextch (patp)
char **patp;
{
    register char ch;
    register char chsum;
    register INT count;

    ch = *(*patp)++;
    if (ch == '\\')
    {
        ch = *(*patp)++;
        if (IS_OCTAL (ch))
        {
            chsum = 0;
            for (count = 0; count < 3 && IS_OCTAL (ch); count++)
            {
                chsum *= 8;
                chsum += ch - '0';
                ch = *(*patp)++;
            }
            (*patp)--;
            ch = chsum;
        }
    }
    return(ch);
}