mkindex.c revision 1.4       1 /*	$NetBSD: mkindex.c,v 1.4 1998/09/11 13:16:05 hubertf Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * Barry Brachman.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  */
     38 
     39 #ifndef lint
     40 static char copyright[] =
     41 "@(#) Copyright (c) 1993\n\
     42 	The Regents of the University of California.  All rights reserved.\n";
     43 #endif /* not lint */
     44 
     45 #ifndef lint
     46 #if 0
     47 static char sccsid[] = "@(#)mkindex.c	8.1 (Berkeley) 6/11/93";
     48 #else
     49 static char rcsid[] = "$NetBSD: mkindex.c,v 1.4 1998/09/11 13:16:05 hubertf Exp $";
     50 #endif
     51 #endif /* not lint */
     52 
     53 #include <stdio.h>
     54 
     55 #include "bog.h"
     56 
     57 char *nextword __P((FILE *, char *, int *, int *));
     58 
     59 int
     60 main(void)
     61 {
     62 	int clen, rlen, prev;
     63 	long off, start;
     64 	char buf[MAXWORDLEN + 1];
     65 
     66 	prev = '\0';
     67 	off = start = 0L;
     68 	while (nextword(stdin, buf, &clen, &rlen) != NULL) {
     69 		if (*buf != prev) {
     70 			if (prev != '\0')
     71 				printf("%c %6ld %6ld\n", prev, start, off - 1);
     72 			prev = *buf;
     73 			start = off;
     74 		}
     75 		off += clen + 1;
     76 	}
     77 	printf("%c %6ld %6ld\n", prev, start, off - 1);
     78 	exit(0);
     79 }
     80 
     81 /*
     82  * Return the next word in the compressed dictionary in 'buffer' or
     83  * NULL on end-of-file
     84  * Also set clen to the length of the compressed word (for mkindex) and
     85  * rlen to the strlen() of the real word
     86  */
     87 char *
     88 nextword(fp, buffer, clen, rlen)
     89 	FILE *fp;
     90 	char *buffer;
     91 	int *clen, *rlen;
     92 {
     93 	int ch, pcount;
     94 	char *p, *q;
     95 	static char buf[MAXWORDLEN + 1];
     96 	static int first = 1;
     97 	static int lastch = 0;
     98 
     99    	if (first) {
    100 		if ((pcount = getc(fp)) == EOF)
    101 			return (NULL);
    102 		first = 0;
    103 	}
    104 	else if ((pcount = lastch) == EOF)
    105 		return (NULL);
    106 
    107 	p = buf + (*clen = pcount);
    108 
    109 	while ((ch = getc(fp)) != EOF && ch >= 'a')
    110 			*p++ = ch;
    111 		lastch = ch;
    112 	*p = '\0';
    113 
    114 	*rlen = (int) (p - buf);
    115 	*clen = *rlen - *clen;
    116 
    117 	p = buf;
    118 	q = buffer;
    119 	while ((*q++ = *p) != '\0') {
    120 		if (*p++ == 'q')
    121 			*q++ = 'u';
    122 	}
    123 	return (buffer);
    124 }
    125