/*
* Copyright 2005 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include <locale.h>
#include "refer..c"
#define BSIZ 250
int
getq(char *v[])
{
static char buff[BSIZ];
static int eof = 0;
extern char *sinput;
char *p;
int c, n = 0, las = 0;
if (eof)
return (-1);
p = buff;
while ((c = (sinput ? *sinput++ : getchar())) > 0) {
if (c == '\n')
break;
if (isalpha(c) || isdigit(c)) {
if (las == 0) {
v[n++] = p;
las = 1;
}
if (las++ <= 6)
*p++ = c;
} else {
if (las > 0)
*p++ = 0;
las = 0;
}
}
*p = 0;
if (p > buff + BSIZ)
fprintf(stderr, gettext("query long than %d characters\n"),
BSIZ);
assert(p < buff + BSIZ);
if (sinput == 0 && c <= 0) eof = 1;
#if D1
fprintf(stderr, "no. keys %d\n", n);
for (c = 0; c < n; c++)
fprintf(stderr, "keys X%sX\n", v[c]);
#endif
return (n);
}