[unix-history] / usr / src / usr.bin / error / subr.c

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms are permitted
 * provided that the above copyright notice and this paragraph are
 * duplicated in all such forms and that any documentation,
 * advertising materials, and other materials related to such
 * distribution and use acknowledge that the software was developed
 * by the University of California, Berkeley.  The name of the
 * University may not be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 */

#ifndef lint
static char sccsid[] = "@(#)subr.c	5.3 (Berkeley) %G%";
#endif /* not lint */

#include <stdio.h>
#include <ctype.h>
#include "error.h"
/*
 *	Arrayify a list of rules
 */
arrayify(e_length, e_array, header)
	int	*e_length;
	Eptr	**e_array;
	Eptr	header;
{
	reg	Eptr	errorp;
	reg	Eptr	*array;
	reg	int	listlength;
	reg	int	listindex;

	for (errorp = header, listlength = 0;
	     errorp; errorp = errorp->error_next, listlength++)
		continue;
	array = (Eptr*)Calloc(listlength+1, sizeof (Eptr));
	for(listindex = 0, errorp = header;
	    listindex < listlength;
	    listindex++, errorp = errorp->error_next){
		array[listindex] = errorp;
		errorp->error_position = listindex;
	}
	array[listindex] = (Eptr)0;
	*e_length = listlength;
	*e_array = array;
}

/*VARARGS1*/
error(msg, a1, a2, a3)
	char	*msg;
{
	fprintf(stderr, "Error: ");
	fprintf(stderr, msg, a1, a2, a3);
	fprintf(stderr, "\n");
	fflush(stdout);
	fflush(stderr);
	exit(6);
}
/*ARGSUSED*/
char *Calloc(nelements, size)
	int	nelements;
	int	size;
{
	char	*back;
	if ( (back = (char *)calloc(nelements, size)) == (char *)NULL){
		error("Ran out of memory.\n");
		exit(1);
	}
	return(back);
}

char *strsave(instring)
	char	*instring;
{
	char	*outstring;
	(void)strcpy(outstring = (char *)Calloc(1, strlen(instring) + 1),
		instring);
	return(outstring);
}
/*
 *	find the position of a given character in a string
 *		(one based)
 */
int position(string, ch)
	reg	char	*string;
	reg	char	ch;
{
	reg	int	i;
	if (string)
	for (i=1; *string; string++, i++){
		if (*string == ch)
			return(i);
	}
	return(-1);
}
/*
 *	clobber the first occurance of ch in string by the new character
 */
char *substitute(string, chold, chnew)
	char	*string;
	char	chold, chnew;
{
	reg	char	*cp = string;

	if (cp)
	while (*cp){
		if (*cp == chold){
			*cp = chnew;
			break;
		}
		cp++;
	}
	return(string);
}

char lastchar(string)
	char	*string;
{
	int	length;
	if (string == 0) return('\0');
	length = strlen(string);
	if (length >= 1)
		return(string[length-1]);
	else
		return('\0');
}

char firstchar(string)
	char	*string;
{
	if (string)
		return(string[0]);
	else
		return('\0');
}

char	next_lastchar(string)
	char	*string;
{
	int	length;
	if (string == 0) return('\0');
	length = strlen(string);
	if (length >= 2)
		return(string[length - 2]);
	else
		return('\0');
}

clob_last(string, newstuff)
	char	*string, newstuff;
{
	int	length = 0;
	if (string)
		length = strlen(string);
	if (length >= 1)
		string[length - 1] = newstuff;
}

/*
 *	parse a string that is the result of a format %s(%d)
 *	return TRUE if this is of the proper format
 */
boolean persperdexplode(string, r_perd, r_pers)
	char	*string;
	char	**r_perd, **r_pers;
{
	reg	char	*cp;
		int	length = 0;

	if (string)
		length = strlen(string);
	if (   (length >= 4)
	    && (string[length - 1] == ')' ) ){
		for (cp = &string[length - 2];
		     (isdigit(*cp)) && (*cp != '(');
		     --cp)
			continue;
		if (*cp == '('){
			string[length - 1] = '\0';	/* clobber the ) */
			*r_perd = strsave(cp+1);
			string[length - 1] = ')';
			*cp = '\0';			/* clobber the ( */
			*r_pers = strsave(string);
			*cp = '(';
			return(TRUE);
		} 
	}
	return(FALSE);
}
/*
 *	parse a quoted string that is the result of a format \"%s\"(%d)
 *	return TRUE if this is of the proper format
 */
boolean qpersperdexplode(string, r_perd, r_pers)
	char	*string;
	char	**r_perd, **r_pers;
{
	reg	char	*cp;
		int	length = 0;

	if (string)
		length = strlen(string);
	if (   (length >= 4)
	    && (string[length - 1] == ')' ) ){
		for (cp = &string[length - 2];
		     (isdigit(*cp)) && (*cp != '(');
		     --cp)
			continue;
		if (*cp == '(' && *(cp - 1) == '"'){
			string[length - 1] = '\0';
			*r_perd = strsave(cp+1);
			string[length - 1] = ')';
			*(cp - 1) = '\0';		/* clobber the " */
			*r_pers = strsave(string + 1);
			*(cp - 1) = '"';
			return(TRUE);
		} 
	}
	return(FALSE);
}

static	char	cincomment[] = CINCOMMENT;
static	char	coutcomment[] = COUTCOMMENT;
static	char	fincomment[] = FINCOMMENT;
static	char	foutcomment[] = FOUTCOMMENT;
static	char	newline[] = NEWLINE;
static	char	piincomment[] = PIINCOMMENT;
static	char	pioutcomment[] = PIOUTCOMMENT;
static	char	lispincomment[] = LISPINCOMMENT;
static	char	riincomment[] = RIINCOMMENT;
static	char	rioutcomment[] = RIOUTCOMMENT;
static	char	troffincomment[] = TROFFINCOMMENT;
static	char	troffoutcomment[] = TROFFOUTCOMMENT;
static	char	mod2incomment[] = MOD2INCOMMENT;
static	char	mod2outcomment[] = MOD2OUTCOMMENT;

struct	lang_desc lang_table[] = {
	/*INUNKNOWN	0*/	"unknown", cincomment,	coutcomment,
	/*INCPP		1*/	"cpp",	cincomment,    coutcomment,
	/*INCC		2*/	"cc",	cincomment,    coutcomment,
	/*INAS		3*/	"as",	ASINCOMMENT,   newline,
	/*INLD		4*/	"ld",	cincomment,    coutcomment,
	/*INLINT	5*/	"lint",	cincomment,    coutcomment,
	/*INF77		6*/	"f77",	fincomment,    foutcomment,
	/*INPI		7*/	"pi",	piincomment,   pioutcomment,
	/*INPC		8*/	"pc",	piincomment,   pioutcomment,
	/*INFRANZ	9*/	"franz",lispincomment, newline,
	/*INLISP	10*/	"lisp",	lispincomment, newline,
	/*INVAXIMA	11*/	"vaxima",lispincomment,newline,
	/*INRATFOR	12*/	"ratfor",fincomment,   foutcomment,
	/*INLEX		13*/	"lex",	cincomment,    coutcomment,
	/*INYACC	14*/	"yacc",	cincomment,    coutcomment,
	/*INAPL		15*/	"apl",	".lm",	       newline,
	/*INMAKE	16*/	"make",	ASINCOMMENT,   newline,
	/*INRI		17*/	"ri",	riincomment,   rioutcomment,
	/*INTROFF	18*/	"troff",troffincomment,troffoutcomment,
	/*INMOD2	19*/	"mod2",	mod2incomment, mod2outcomment,
				0,	0,	     0
};

printerrors(look_at_subclass, errorc, errorv)
	boolean	look_at_subclass;
	int	errorc;
	Eptr	errorv[];
{
	reg	int	i;
	reg	Eptr	errorp;

	for (errorp = errorv[i = 0]; i < errorc; errorp = errorv[++i]){
		if (errorp->error_e_class == C_IGNORE)
			continue;
		if (look_at_subclass && errorp->error_s_class == C_DUPL)
			continue;
		printf("Error %d, (%s error) [%s], text = \"",
			i,
			class_table[errorp->error_e_class],
			lang_table[errorp->error_language].lang_name);
		wordvprint(stdout,errorp->error_lgtext,errorp->error_text);
		printf("\"\n");
	}
}

wordvprint(fyle, wordc, wordv)
	FILE	*fyle;
	int	wordc;
	char	*wordv[];
{
	int	i;
	char *sep = "";

	for(i = 0; i < wordc; i++)
		if (wordv[i]) {
			fprintf(fyle, "%s%s",sep,wordv[i]);
			sep = " ";
		}
}

/*
 *	Given a string, parse it into a number of words, and build
 *	a wordc wordv combination pointing into it.
 */
wordvbuild(string, r_wordc, r_wordv)
	char	*string;
	int	*r_wordc;
	char	***r_wordv;
{
	reg	char 	*cp;
		char	*saltedbuffer;
		char	**wordv;
		int	wordcount;
		int	wordindex;

	saltedbuffer = strsave(string);
	for (wordcount = 0, cp = saltedbuffer; *cp; wordcount++){
		while (*cp  && isspace(*cp))
			cp++;
		if (*cp == 0)
			break;
		while (!isspace(*cp))
			cp++;
	}
	wordv = (char **)Calloc(wordcount + 1, sizeof (char *));
	for (cp=saltedbuffer,wordindex=0; wordcount; wordindex++,--wordcount){
		while (*cp && isspace(*cp))
			cp++;
		if (*cp == 0)
			break;
		wordv[wordindex] = cp;
		while(!isspace(*cp))
			cp++;
		*cp++ = '\0';
	}
	if (wordcount != 0)
		error("Initial miscount of the number of words in a line\n");
	wordv[wordindex] = (char *)0;
#ifdef FULLDEBUG
	for (wordcount = 0; wordcount < wordindex; wordcount++)
		printf("Word %d = \"%s\"\n", wordcount, wordv[wordcount]);
	printf("\n");
#endif
	*r_wordc = wordindex;
	*r_wordv = wordv;
}
/*
 *	Compare two 0 based wordvectors
 */
int wordvcmp(wordv1, wordc, wordv2)
	char	**wordv1;
	int	wordc;
	char	**wordv2;
{
	reg	int i;
		int	back;
	for (i = 0; i < wordc; i++){
		if (wordv1[i] == 0 || wordv2[i] == 0)
				return(-1);
		if (back = strcmp(wordv1[i], wordv2[i])){
			return(back);
		}
	}
	return(0);	/* they are equal */
}
		
/*
 *	splice a 0 basedword vector onto the tail of a
 *	new wordv, allowing the first emptyhead slots to be empty
 */
char	**wordvsplice(emptyhead, wordc, wordv)
	int	emptyhead;
	int	wordc;
	char	**wordv;
{
	reg	char	**nwordv;
		int	nwordc = emptyhead + wordc;
	reg	int	i;

	nwordv = (char **)Calloc(nwordc, sizeof (char *));
	for (i = 0; i < emptyhead; i++)
		nwordv[i] = 0;
	for(i = emptyhead; i < nwordc; i++){
		nwordv[i] = wordv[i-emptyhead];
	}
	return(nwordv);
}
/*
 *	plural'ize and verb forms
 */
static	char	*S = "s";
static	char	*N = "";
char *plural(n)
	int	n;
{
	return( n > 1 ? S : N);
}
char *verbform(n)
	int	n;
{
	return( n > 1 ? N : S);
}
Commit	Line	Data
442fe3bf DF	1	/*
442fe3bf DF	2	* Copyright (c) 1980 Regents of the University of California.
c9bf2796 KB	3	* All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms are permitted
9c50374f KB	6	* provided that the above copyright notice and this paragraph are
	7	* duplicated in all such forms and that any documentation,
	8	* advertising materials, and other materials related to such
	9	* distribution and use acknowledge that the software was developed
	10	* by the University of California, Berkeley. The name of the
	11	* University may not be used to endorse or promote products derived
	12	* from this software without specific prior written permission.
	13	* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
	14	* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
	15	* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
442fe3bf DF	16	*/
	17
	18	#ifndef lint
9c50374f	19	static char sccsid[] = "@(#)subr.c 5.3 (Berkeley) %G%";
c9bf2796	20	#endif /* not lint */
442fe3bf	21
a88a9a03 BJ	22	#include <stdio.h>
	23	#include <ctype.h>
	24	#include "error.h"
	25	/*
58195f21	26	* Arrayify a list of rules
a88a9a03 BJ	27	*/
a88a9a03 BJ	28	arrayify(e_length, e_array, header)
58195f21 RH	29	int *e_length;
	30	Eptr **e_array;
	31	Eptr header;
a88a9a03	32	{
58195f21 RH	33	reg Eptr errorp;
	34	reg Eptr *array;
	35	reg int listlength;
	36	reg int listindex;
a88a9a03 BJ	37
	38	for (errorp = header, listlength = 0;
	39	errorp; errorp = errorp->error_next, listlength++)
	40	continue;
58195f21	41	array = (Eptr*)Calloc(listlength+1, sizeof (Eptr));
a88a9a03 BJ	42	for(listindex = 0, errorp = header;
	43	listindex < listlength;
	44	listindex++, errorp = errorp->error_next){
	45	array[listindex] = errorp;
	46	errorp->error_position = listindex;
	47	}
58195f21	48	array[listindex] = (Eptr)0;
a88a9a03 BJ	49	*e_length = listlength;
	50	*e_array = array;
	51	}
	52
	53	/VARARGS1/
	54	error(msg, a1, a2, a3)
	55	char *msg;
	56	{
	57	fprintf(stderr, "Error: ");
	58	fprintf(stderr, msg, a1, a2, a3);
	59	fprintf(stderr, "\n");
	60	fflush(stdout);
	61	fflush(stderr);
	62	exit(6);
	63	}
	64	/ARGSUSED/
	65	char *Calloc(nelements, size)
	66	int nelements;
	67	int size;
	68	{
	69	char *back;
	70	if ( (back = (char )calloc(nelements, size)) == (char )NULL){
	71	error("Ran out of memory.\n");
	72	exit(1);
	73	}
	74	return(back);
	75	}
	76
	77	char *strsave(instring)
	78	char *instring;
	79	{
	80	char *outstring;
58195f21 RH	81	(void)strcpy(outstring = (char *)Calloc(1, strlen(instring) + 1),
58195f21 RH	82	instring);
a88a9a03 BJ	83	return(outstring);
	84	}
	85	/*
	86	* find the position of a given character in a string
	87	* (one based)
	88	*/
	89	int position(string, ch)
58195f21 RH	90	reg char *string;
58195f21 RH	91	reg char ch;
a88a9a03	92	{
58195f21	93	reg int i;
338c4a5d	94	if (string)
a88a9a03 BJ	95	for (i=1; *string; string++, i++){
	96	if (*string == ch)
	97	return(i);
	98	}
	99	return(-1);
	100	}
	101	/*
	102	* clobber the first occurance of ch in string by the new character
	103	*/
	104	char *substitute(string, chold, chnew)
	105	char *string;
	106	char chold, chnew;
	107	{
58195f21	108	reg char *cp = string;
a88a9a03	109
338c4a5d	110	if (cp)
a88a9a03 BJ	111	while (*cp){
	112	if (*cp == chold){
	113	*cp = chnew;
	114	break;
	115	}
	116	cp++;
	117	}
	118	return(string);
	119	}
	120
	121	char lastchar(string)
	122	char *string;
	123	{
	124	int length;
338c4a5d	125	if (string == 0) return('\0');
a88a9a03 BJ	126	length = strlen(string);
	127	if (length >= 1)
	128	return(string[length-1]);
	129	else
	130	return('\0');
	131	}
	132
	133	char firstchar(string)
	134	char *string;
	135	{
338c4a5d SL	136	if (string)
	137	return(string[0]);
	138	else
	139	return('\0');
a88a9a03 BJ	140	}
	141
	142	char next_lastchar(string)
	143	char *string;
	144	{
	145	int length;
338c4a5d	146	if (string == 0) return('\0');
a88a9a03 BJ	147	length = strlen(string);
	148	if (length >= 2)
	149	return(string[length - 2]);
	150	else
	151	return('\0');
	152	}
	153
	154	clob_last(string, newstuff)
	155	char *string, newstuff;
	156	{
338c4a5d SL	157	int length = 0;
	158	if (string)
	159	length = strlen(string);
a88a9a03 BJ	160	if (length >= 1)
	161	string[length - 1] = newstuff;
	162	}
	163
	164	/*
	165	* parse a string that is the result of a format %s(%d)
	166	* return TRUE if this is of the proper format
	167	*/
	168	boolean persperdexplode(string, r_perd, r_pers)
	169	char *string;
	170	char r_perd, r_pers;
	171	{
58195f21	172	reg char *cp;
338c4a5d	173	int length = 0;
a88a9a03	174
338c4a5d SL	175	if (string)
338c4a5d SL	176	length = strlen(string);
a88a9a03 BJ	177	if ( (length >= 4)
	178	&& (string[length - 1] == ')' ) ){
	179	for (cp = &string[length - 2];
	180	(isdigit(cp)) && (cp != '(');
	181	--cp)
	182	continue;
	183	if (*cp == '('){
	184	string[length - 1] = '\0'; /* clobber the ) */
	185	*r_perd = strsave(cp+1);
	186	string[length - 1] = ')';
	187	cp = '\0'; / clobber the ( */
	188	*r_pers = strsave(string);
	189	*cp = '(';
	190	return(TRUE);
	191	}
	192	}
	193	return(FALSE);
	194	}
	195	/*
	196	* parse a quoted string that is the result of a format \"%s\"(%d)
	197	* return TRUE if this is of the proper format
	198	*/
	199	boolean qpersperdexplode(string, r_perd, r_pers)
	200	char *string;
	201	char r_perd, r_pers;
	202	{
58195f21	203	reg char *cp;
338c4a5d	204	int length = 0;
a88a9a03	205
338c4a5d SL	206	if (string)
338c4a5d SL	207	length = strlen(string);
a88a9a03 BJ	208	if ( (length >= 4)
	209	&& (string[length - 1] == ')' ) ){
	210	for (cp = &string[length - 2];
	211	(isdigit(cp)) && (cp != '(');
	212	--cp)
	213	continue;
	214	if (cp == '(' && (cp - 1) == '"'){
	215	string[length - 1] = '\0';
	216	*r_perd = strsave(cp+1);
	217	string[length - 1] = ')';
	218	(cp - 1) = '\0'; / clobber the " */
	219	*r_pers = strsave(string + 1);
	220	*(cp - 1) = '"';
	221	return(TRUE);
	222	}
	223	}
	224	return(FALSE);
	225	}
	226
	227	static char cincomment[] = CINCOMMENT;
	228	static char coutcomment[] = COUTCOMMENT;
	229	static char fincomment[] = FINCOMMENT;
	230	static char foutcomment[] = FOUTCOMMENT;
	231	static char newline[] = NEWLINE;
	232	static char piincomment[] = PIINCOMMENT;
	233	static char pioutcomment[] = PIOUTCOMMENT;
	234	static char lispincomment[] = LISPINCOMMENT;
	235	static char riincomment[] = RIINCOMMENT;
	236	static char rioutcomment[] = RIOUTCOMMENT;
243bdea5 RH	237	static char troffincomment[] = TROFFINCOMMENT;
243bdea5 RH	238	static char troffoutcomment[] = TROFFOUTCOMMENT;
07e24738 RH	239	static char mod2incomment[] = MOD2INCOMMENT;
07e24738 RH	240	static char mod2outcomment[] = MOD2OUTCOMMENT;
a88a9a03 BJ	241
	242	struct lang_desc lang_table[] = {
	243	/INUNKNOWN 0/ "unknown", cincomment, coutcomment,
	244	/INCPP 1/ "cpp", cincomment, coutcomment,
	245	/INCC 2/ "cc", cincomment, coutcomment,
	246	/INAS 3/ "as", ASINCOMMENT, newline,
	247	/INLD 4/ "ld", cincomment, coutcomment,
	248	/INLINT 5/ "lint", cincomment, coutcomment,
	249	/INF77 6/ "f77", fincomment, foutcomment,
	250	/INPI 7/ "pi", piincomment, pioutcomment,
	251	/INPC 8/ "pc", piincomment, pioutcomment,
	252	/INFRANZ 9/ "franz",lispincomment, newline,
	253	/INLISP 10/ "lisp", lispincomment, newline,
	254	/INVAXIMA 11/ "vaxima",lispincomment,newline,
	255	/INRATFOR 12/ "ratfor",fincomment, foutcomment,
	256	/INLEX 13/ "lex", cincomment, coutcomment,
	257	/INYACC 14/ "yacc", cincomment, coutcomment,
	258	/INAPL 15/ "apl", ".lm", newline,
	259	/INMAKE 16/ "make", ASINCOMMENT, newline,
	260	/INRI 17/ "ri", riincomment, rioutcomment,
243bdea5	261	/INTROFF 18/ "troff",troffincomment,troffoutcomment,
07e24738	262	/INMOD2 19/ "mod2", mod2incomment, mod2outcomment,
a88a9a03 BJ	263	0, 0, 0
	264	};
	265
	266	printerrors(look_at_subclass, errorc, errorv)
	267	boolean look_at_subclass;
	268	int errorc;
58195f21	269	Eptr errorv[];
a88a9a03	270	{
58195f21 RH	271	reg int i;
	272	reg Eptr errorp;
	273
a88a9a03 BJ	274	for (errorp = errorv[i = 0]; i < errorc; errorp = errorv[++i]){
	275	if (errorp->error_e_class == C_IGNORE)
	276	continue;
	277	if (look_at_subclass && errorp->error_s_class == C_DUPL)
	278	continue;
	279	printf("Error %d, (%s error) [%s], text = \"",
	280	i,
	281	class_table[errorp->error_e_class],
	282	lang_table[errorp->error_language].lang_name);
	283	wordvprint(stdout,errorp->error_lgtext,errorp->error_text);
	284	printf("\"\n");
	285	}
	286	}
	287
	288	wordvprint(fyle, wordc, wordv)
	289	FILE *fyle;
	290	int wordc;
	291	char *wordv[];
	292	{
	293	int i;
802448ad SL	294	char *sep = "";
	295
	296	for(i = 0; i < wordc; i++)
	297	if (wordv[i]) {
	298	fprintf(fyle, "%s%s",sep,wordv[i]);
	299	sep = " ";
	300	}
a88a9a03 BJ	301	}
	302
	303	/*
	304	* Given a string, parse it into a number of words, and build
	305	* a wordc wordv combination pointing into it.
	306	*/
	307	wordvbuild(string, r_wordc, r_wordv)
	308	char *string;
	309	int *r_wordc;
	310	char ***r_wordv;
	311	{
58195f21 RH	312	reg char *cp;
	313	char *saltedbuffer;
	314	char **wordv;
	315	int wordcount;
	316	int wordindex;
a88a9a03 BJ	317
	318	saltedbuffer = strsave(string);
	319	for (wordcount = 0, cp = saltedbuffer; *cp; wordcount++){
	320	while (cp && isspace(cp))
	321	cp++;
	322	if (*cp == 0)
	323	break;
	324	while (!isspace(*cp))
	325	cp++;
	326	}
	327	wordv = (char *)Calloc(wordcount + 1, sizeof (char ));
	328	for (cp=saltedbuffer,wordindex=0; wordcount; wordindex++,--wordcount){
	329	while (cp && isspace(cp))
	330	cp++;
	331	if (*cp == 0)
	332	break;
	333	wordv[wordindex] = cp;
	334	while(!isspace(*cp))
	335	cp++;
	336	*cp++ = '\0';
	337	}
	338	if (wordcount != 0)
	339	error("Initial miscount of the number of words in a line\n");
	340	wordv[wordindex] = (char *)0;
	341	#ifdef FULLDEBUG
	342	for (wordcount = 0; wordcount < wordindex; wordcount++)
	343	printf("Word %d = \"%s\"\n", wordcount, wordv[wordcount]);
	344	printf("\n");
	345	#endif
	346	*r_wordc = wordindex;
	347	*r_wordv = wordv;
	348	}
	349	/*
	350	* Compare two 0 based wordvectors
	351	*/
	352	int wordvcmp(wordv1, wordc, wordv2)
	353	char **wordv1;
	354	int wordc;
	355	char **wordv2;
	356	{
58195f21 RH	357	reg int i;
58195f21 RH	358	int back;
a88a9a03	359	for (i = 0; i < wordc; i++){
338c4a5d SL	360	if (wordv1[i] == 0 \|\| wordv2[i] == 0)
338c4a5d SL	361	return(-1);
a88a9a03 BJ	362	if (back = strcmp(wordv1[i], wordv2[i])){
	363	return(back);
	364	}
	365	}
	366	return(0); /* they are equal */
	367	}
	368
	369	/*
	370	* splice a 0 basedword vector onto the tail of a
	371	* new wordv, allowing the first emptyhead slots to be empty
	372	*/
	373	char **wordvsplice(emptyhead, wordc, wordv)
	374	int emptyhead;
	375	int wordc;
	376	char **wordv;
	377	{
58195f21 RH	378	reg char **nwordv;
	379	int nwordc = emptyhead + wordc;
	380	reg int i;
a88a9a03 BJ	381
	382	nwordv = (char *)Calloc(nwordc, sizeof (char ));
	383	for (i = 0; i < emptyhead; i++)
	384	nwordv[i] = 0;
	385	for(i = emptyhead; i < nwordc; i++){
	386	nwordv[i] = wordv[i-emptyhead];
	387	}
	388	return(nwordv);
	389	}
58195f21 RH	390	/*
	391	* plural'ize and verb forms
	392	*/
	393	static char *S = "s";
	394	static char *N = "";
	395	char *plural(n)
	396	int n;
	397	{
	398	return( n > 1 ? S : N);
	399	}
	400	char *verbform(n)
	401	int n;
	402	{
	403	return( n > 1 ? N : S);
	404	}
	405