refer2.c revision 7c478bd95313f5f23a4c958a745db2134aa03244
/* 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.
*/
/*
* Copyright (c) 1983, 1984 1985, 1986, 1987, 1988, Sun Microsystems, Inc.
* All Rights Reserved.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
#include "refer..c"
#include <locale.h>
#define NFLD 30
#define TLEN 512
char *line1;
{
Iline++;
break;
break;
break;
query = 1;
}
return;
dumpold();
return;
}
answer[0] = 0;
for (p = buff; *p; p++) {
if (isupper(*p))
*p |= 040;
}
for (p = buff; *p; p++) {
if (isalpha(*p))
alph++;
else
if (isdigit(*p))
digs++;
else {
*p = 0;
r = p-alph;
while (r < p)
*r++ = ' ';
}
r = p-digs;
while (r < p)
*r++ = ' ';
}
}
*p = ' ';
}
}
one[0] = 0;
if (buff[0]) { /* do not search if no query */
temp[0] = 0;
break;
}
}
if (buff[0])
case 0:
return;
default:
p = buff;
while (*p != '\n')
p++;
*++p = 0;
case 1:
if (endpush)
if (bare < 2) {
}
return;
}
if (one[0] == 0)
break;
}
refnum++;
if (sort)
if (bare < 2)
else
flout();
goto again;
}
newline(s)
char *s;
{
int k = 0, c;
while (c = *s++)
if (c == '\n')
k++;
return(k);
}
char *buff;
{
int nl;
for (r = p = buff; *p; p++) {
if (*p == '\n') {
*p++ = 0;
nl = 1;
for (q = ob; *q; q++) {
q += 3;
for (t = q; *t && *t != '\n'; t++)
;
*t = 0;
q = 0;
break;
}
nl = *q == '\n';
}
if (q)
r=p;
}
}
}
control(c)
{
if (c == '.')
return(1);
if (c == '%')
return(1);
return(0);
}