hunt6.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 <stdio.h>
#include <assert.h>
#include <string.h>
#define TXTLEN 1000
char *outbuf = 0;
extern char *soutput;
extern long indexdate;
union ptr {
unsigned *a;
long *b;
};
unsigned *mptr;
{
/* checks list of drops for real bad drops; finds items with "deliv" */
long lp;
if (iflong) {
}
else {
}
# if D1
if (iflong)
else
# endif
for (i=g=0; i<nf; i++)
{
# if D1
if (iflong)
else
# endif
# if D1
# endif
{
char *s;
int c;
# if D1
# endif
for(s=res; c= *s; s++)
if (c == ';' || c == '\n')
{
*s=0;
break;
}
if (rprog)
else
{
if (len > 0) /* copy and free */
{
}
else /* insufficient memory or other... */
len = 0;
}
}
# if D1
# endif
if (len==0)
continue;
na=0;
for(j=0; j<nitem; j++)
# ifdef D1
# endif
{
# ifdef D1
# endif
if (iflong)
else
if (full >= g)
if (soutput==0)
else
}
# ifdef D1
# endif
}
return(g);
}
{
long lp, c;
int len;
if (fd==0)return(0);
while (c = *res++)
{
if (c == ';')
{
return(1);
}
}
return(0);
}