/*
* 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 <stdlib.h>
#include <signal.h>
#include <locale.h>
#include "refer..c"
extern void clfgrep();
extern void doref();
extern void dumpold();
extern void err();
extern void output();
extern int prefix();
extern void recopy();
void cleanup(void);
void signals(void);
int
{
int nodeflt = 0;
#if !defined(TEXT_DOMAIN)
#endif
(void) textdomain(TEXT_DOMAIN);
signals();
case 'e':
endpush++;
break;
case 's':
sort++;
endpush = 1;
break;
case 'l':
labels++;
while (*s)
if (*s++ == ',')
break;
break;
case 'k':
labels++;
break;
case 'n':
nodeflt = 1;
break;
case 'p':
argc--;
argv++;
"too many -p options (%d)"), NSERCH);
break;
case 'a':
if (authrev <= 0)
authrev = 1000;
break;
case 'b':
break;
case 'c':
break;
case 'f':
break;
case 'B':
biblio++;
bare = 2;
break;
case 'S':
science++;
labels = 1;
break;
case 'P':
postpunct++;
break;
}
argc--;
argv++;
}
else if (nodeflt == 0)
exit(1);
}
}
if (endpush) {
}
} else
do {
if (argc > 1) {
Iline = 0;
argc--;
argv++;
continue;
}
}
Iline++;
else
}
} while (argc > 1);
dumpold();
output("");
clfgrep();
cleanup();
return (0);
}
extern void intr();
void
signals(void)
{
}
void
intr(void)
{
cleanup();
exit(1);
}
void
cleanup(void)
{
if (tfile[0])
if (gfile[0])
if (ofile[0])
if (hidenam[0])
}