Gecko [ georgetownmover.com ]

Name	Size	Permission	Date
Makefile	5.98 KB	-rw-r--r--	2023-01-11 06:22
ckp_std.c	1.16 KB	-rw-r--r--	2023-01-11 06:22
drivers	989 B	-rwxr-xr-x	2023-01-11 06:22
dummy.c	24.66 KB	-rw-r--r--	2023-01-11 06:22
dummy.h	1.49 KB	-rw-r--r--	2023-01-11 06:22
env_ami.c	40.72 KB	-rw-r--r--	2023-01-11 06:22
env_ami.h	2.86 KB	-rw-r--r--	2023-01-11 06:22
fdstring.c	2.76 KB	-rw-r--r--	2023-01-11 06:22
fdstring.h	1.05 KB	-rw-r--r--	2023-01-11 06:22
fs_ami.c	1.84 KB	-rw-r--r--	2023-01-11 06:22
ftl_ami.c	955 B	-rw-r--r--	2023-01-11 06:22
gethstid.c	975 B	-rw-r--r--	2023-01-11 06:22
gr_waitp.c	1.06 KB	-rw-r--r--	2023-01-11 06:22
log_std.c	1.12 KB	-rw-r--r--	2023-01-11 06:22
mbx.c	61.93 KB	-rw-r--r--	2023-01-11 06:22
mh.c	39.67 KB	-rw-r--r--	2023-01-11 06:22
mix.c	92.52 KB	-rw-r--r--	2023-01-11 06:22
mkauths	1.18 KB	-rwxr-xr-x	2023-01-11 06:22
mmdf.c	89.34 KB	-rw-r--r--	2023-01-11 06:22
mtx.c	45.09 KB	-rw-r--r--	2023-01-11 06:22
mx.c	39.05 KB	-rw-r--r--	2023-01-11 06:22
news.c	21.78 KB	-rw-r--r--	2023-01-11 06:22
nl_ami.c	2.56 KB	-rw-r--r--	2023-01-11 06:22
os_ami.c	2.03 KB	-rw-r--r--	2023-01-11 06:22
os_ami.h	1.41 KB	-rw-r--r--	2023-01-11 06:22
phile.c	16.28 KB	-rw-r--r--	2023-01-11 06:22
pmatch.c	2.77 KB	-rw-r--r--	2023-01-11 06:22
pseudo.c	1.24 KB	-rw-r--r--	2023-01-11 06:22
pseudo.h	838 B	-rw-r--r--	2023-01-11 06:22
scandir.c	2.61 KB	-rw-r--r--	2023-01-11 06:22
ssl_none.c	2.57 KB	-rw-r--r--	2023-01-11 06:22
tcp_ami.c	24.32 KB	-rw-r--r--	2023-01-11 06:22
tcp_ami.h	1.2 KB	-rw-r--r--	2023-01-11 06:22
tenex.c	48.69 KB	-rw-r--r--	2023-01-11 06:22
tz_bsd.c	989 B	-rw-r--r--	2023-01-11 06:22
unix.c	92.97 KB	-rw-r--r--	2023-01-11 06:22
unix.h	8.64 KB	-rw-r--r--	2023-01-11 06:22
write.c	1.74 KB	-rw-r--r--	2023-01-11 06:22

Rename

/* ========================================================================
 * Copyright 1988-2006 University of Washington
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * 
 * ========================================================================
 */

/*
 * Program:	IMAP Wildcard Matching Routines (case-dependent)
 *
 * Author:	Mark Crispin
 *		Networks and Distributed Computing
 *		Computing & Communications
 *		University of Washington
 *		Administration Building, AG-44
 *		Seattle, WA  98195
 *		Internet: MRC@CAC.Washington.EDU
 *
 * Date:	15 June 2000
 * Last Edited:	30 August 2006
 */

/* Wildcard pattern match
 * Accepts: base string
 *	    pattern string
 *	    delimiter character
 * Returns: T if pattern matches base, else NIL
 */

long pmatch_full (unsigned char *s,unsigned char *pat,unsigned char delim)
{
  switch (*pat) {
  case '%':			/* non-recursive */
				/* % at end, OK if no inferiors */
    if (!pat[1]) return (delim && strchr (s,delim)) ? NIL : T;
                                /* scan remainder of string until delimiter */
    do if (pmatch_full (s,pat+1,delim)) return T;
    while ((*s != delim) && *s++);
    break;
  case '*':			/* match 0 or more characters */
    if (!pat[1]) return T;	/* * at end, unconditional match */
				/* scan remainder of string */
    do if (pmatch_full (s,pat+1,delim)) return T;
    while (*s++);
    break;
  case '\0':			/* end of pattern */
    return *s ? NIL : T;	/* success if also end of base */
  default:			/* match this character */
    return (*pat == *s) ? pmatch_full (s+1,pat+1,delim) : NIL;
  }
  return NIL;
}

/* Directory pattern match
 * Accepts: base string
 *	    pattern string
 *	    delimiter character
 * Returns: T if base is a matching directory of pattern, else NIL
 */

long dmatch (unsigned char *s,unsigned char *pat,unsigned char delim)
{
  switch (*pat) {
  case '%':			/* non-recursive */
    if (!*s) return T;		/* end of base means have a subset match */
    if (!*++pat) return NIL;	/* % at end, no inferiors permitted */
				/* scan remainder of string until delimiter */
    do if (dmatch (s,pat,delim)) return T;
    while ((*s != delim) && *s++);
    if (*s && !s[1]) return T;	/* ends with delimiter, must be subset */
    return dmatch (s,pat,delim);/* do new scan */
  case '*':			/* match 0 or more characters */
    return T;			/* unconditional match */
  case '\0':			/* end of pattern */
    break;
  default:			/* match this character */
    if (*s) return (*pat == *s) ? dmatch (s+1,pat+1,delim) : NIL;
				/* end of base, return if at delimiter */
    else if (*pat == delim) return T;
    break;
  }
  return NIL;
}