DataMuseum.dk

top - metrics - download

    Length: 3450 (0xd7a)
    Types: TextFile
    Names: »word.c«

└─⟦b20c6495f⟧ Bits:30007238 EUUGD18: Wien-båndet, efterår 1987
    └─⟦this⟧ »EUUGD18/General/Bog/word.c« 

TextFile

/* vi: set tabstop=4 : */

#include <stdio.h>

#include "bog.h"

#ifdef ATARI
#include <stat.h>
#include <osbind.h>
#define malloc(x)       Malloc(x)
#else
#include <sys/types.h>
#include <sys/stat.h>
#endif

static char *dictspace, *dictend;
static char *sp;

static int first = 1, lastch = 0;

/*
 * Return the next word in the compressed dictionary in 'buffer' or
 * NULL on end-of-file
 */
char *
nextword(fp)
FILE *fp;
{
    register int ch, pcount;
	register char *p;
	static char buf[MAXWORDLEN + 1];
	extern int wordlen;

	if (fp == (FILE *) NULL) {
	    if (sp == dictend)
			return((char *) NULL);

		p = buf + (int) *sp++;

		/*
		 * The dictionary ends with a null byte
		 */
	    while (*sp >= 'a') {
			if ((*p++ = *sp++) == 'q')
				*p++ = 'u';
		}
	}
	else {
    	if (first) {
	        if ((pcount = getc(fp)) == EOF)
				return((char *) NULL);
			first = 0;
		}
		else if ((pcount = lastch) == EOF)
			return((char *) NULL);

		p = buf + pcount;
 
	    while ((ch = getc(fp)) != EOF && ch >= 'a') {
			if ((*p++ = ch) == 'q')
				*p++ = 'u';
		}
	    lastch = ch;
	}
	wordlen = (int) (p - buf);
    *p = '\0';
    return(buf);
}
 
/*
 * Reset the state of nextword() and do the fseek()
 */
dictseek(fp, offset, ptrname)
FILE *fp;
long offset;
int ptrname;
{

	if (fp == (FILE *) NULL) {
		if ((sp = dictspace + offset) >= dictend)
			return(-1);
		return(0);
	}

	first = 1;
	return(fseek(fp, offset, ptrname));
}

FILE *
opendict(dict)
char *dict;
{
	FILE *fp;

#ifdef ATARI
	if ((fp = fopen(dict, "rb")) == (FILE *) NULL)
		return((FILE *) NULL);
#else
	if ((fp = fopen(dict, "r")) == (FILE *) NULL)
		return((FILE *) NULL);
#endif
	return(fp);
}

/*
 * Load the given dictionary and initialize the pointers
 */
loaddict(fp)
FILE *fp;
{
	int st;
	char *p;
	long n;
	struct stat statb;

#ifdef ATARI
	if (stat(DICT, &statb) < 0) {
		(void) fclose(fp);
		return(-1);
	}
#else
	char *malloc();

	if (fstat(fileno(fp), &statb) < 0) {
		(void) fclose(fp);
		return(-1);
	}
#endif

	/*
	 * An extra character (a sentinel) is allocated and set to null to improve
	 * the expansion loop in nextword()
	 */
	if ((dictspace = (char *) malloc(statb.st_size + 1)) == (char *) NULL) {
		(void) fclose(fp);
		return(-1);
	}
	n = (long) statb.st_size;
	sp = dictspace;
	dictend = dictspace + n;

	p = dictspace;
	while (n > 0 && (st = fread(p, 1, BUFSIZ, fp)) > 0) {
		p += st;
		n -= st;
	}
	if (st < 0) {
		(void) fclose(fp);
		(void) fprintf(stderr, "Error reading dictionary\n");
		return(-1);
	}
	*p = '\0';
	return(0);
}

/*
 * Dependent on the exact format of the index file:
 * Starting offset field begins in column 1 and length field in column 9
 */
loadindex(indexfile)
char *indexfile;
{
    register int i, j;
    char buf[MAXWORDLEN + 1];
    FILE *fp;
    long atol();
	extern struct dictindex dictindex[];
 
    if ((fp = fopen(indexfile, "r")) == (FILE *) NULL) {
        (void) fprintf(stderr, "Can't open '%s'\n", indexfile);
        return(-1);
    }
    i = 0;
    while (fgets(buf, sizeof(buf), fp) != (char *) NULL) {
        j = *buf - 'a';
        if (i != j) {
            (void) fprintf(stderr, "Bad index order\n");
            return(-1);
        }
        dictindex[j].start = atol(buf + 1);
        dictindex[j].length = atol(buf + 9) - dictindex[j].start;
        i++;
    }
    if (i != 26) {
        (void) fprintf(stderr, "Bad index length\n");
        return(-1);
    }
    (void) fclose(fp);
	return(0);
}