rpp.c

OpenPBS

#ifdef  DEBUG

#define	DBTO	stdout
#define	DBPRT(x) \
	if (rpp_dbprt) { \
		int	err = errno; \
		fprintf(DBTO, "%lX: ", time(0)); \
       		fprintf x; \
		errno = err; \
	}
#define	DOID(x)		static char id[] = x;

#elif	defined(RPPLOG)

static	char	*blog_buf = NULL;
static	int	blog_buflen = 0;

static	int	blog_head = 0;

void
blog_init(char *s, int len)
{
	if (blog_buf != NULL || len <= 0)
		return;

	if (s == NULL)
		blog_buf = (char *)malloc(len);
	else
		blog_buf = s;
	blog_buflen = len;
}

int
blog_write(char *s)
{
	int	i, len;

	if (s == NULL || *s == '\0')
		return 0;

	if (blog_buf == NULL)
		blog_init(NULL, 64*1024);

	len = strlen(s) + 1;
	if (len > blog_buflen)
		return -1;

	for (i=0; i<len; i++) {
		blog_buf[blog_head++] = *s++;
		blog_head %= blog_buflen;
	}
	return len-1;
}

void
blog_out(char *filename)
{
	FILE	*f;
	int	btrail;
	int	c;

	if (blog_buf == NULL)
		return;

	if ((f = fopen(filename, "a")) == NULL)
		return;

	for (btrail = blog_head; blog_buf[btrail] != '\0'; btrail++)
		btrail %= blog_buflen;

	for (btrail++; btrail != blog_head; btrail++) {
		btrail %= blog_buflen;

		c = (int)blog_buf[btrail];
		if (c == '\0')
			continue;

		putc(c, f);
	}
	fclose(f);
	return;
}

static	char	logbuf[4096], *logp;

#define DBTO	logp

#define	DBPRT(x) \
	sprintf(logbuf, "%lX: ", time(0)); \
	logp = logbuf + strlen(logbuf); \
	sprintf x; \
	blog_write(logbuf); \
	if (rpp_dbprt) { \
		int	err = errno; \
		sprintf(logbuf, "/tmp/rpp_log.%d", getpid()); \
		blog_out(logbuf); \
       		rpp_dbprt = 0; \
		errno = err; \
	}
#define	DOID(x)		static char id[] = x;

#else
#define	DBTO	xxx
#define	DBPRT(x)
#define	DOID(x)
#endif


#ifndef	MIN
#define	MIN(x, y)	(((x) < (y)) ? (x) : (y))
#endif
#ifndef	MAX
#define	MAX(x, y)	(((x) > (y)) ? (x) : (y))
#endif


/*
**	BEGIN included source
*/
/*-
 * Copyright (c) 1991, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * James W. Williams of NASA Goddard Space Flight Center.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgment:
 *	This product includes software developed by the University of
 *	California, Berkeley and its contributors.
 * 4. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 */

static u_long crctab[] = {
	0x0,
	0x04c11db7, 0x09823b6e, 0x0d4326d9, 0x130476dc, 0x17c56b6b,
	0x1a864db2, 0x1e475005, 0x2608edb8, 0x22c9f00f, 0x2f8ad6d6,
	0x2b4bcb61, 0x350c9b64, 0x31cd86d3, 0x3c8ea00a, 0x384fbdbd,
	0x4c11db70, 0x48d0c6c7, 0x4593e01e, 0x4152fda9, 0x5f15adac,
	0x5bd4b01b, 0x569796c2, 0x52568b75, 0x6a1936c8, 0x6ed82b7f,
	0x639b0da6, 0x675a1011, 0x791d4014, 0x7ddc5da3, 0x709f7b7a,
	0x745e66cd, 0x9823b6e0, 0x9ce2ab57, 0x91a18d8e, 0x95609039,
	0x8b27c03c, 0x8fe6dd8b, 0x82a5fb52, 0x8664e6e5, 0xbe2b5b58,
	0xbaea46ef, 0xb7a96036, 0xb3687d81, 0xad2f2d84, 0xa9ee3033,
	0xa4ad16ea, 0xa06c0b5d, 0xd4326d90, 0xd0f37027, 0xddb056fe,
	0xd9714b49, 0xc7361b4c, 0xc3f706fb, 0xceb42022, 0xca753d95,
	0xf23a8028, 0xf6fb9d9f, 0xfbb8bb46, 0xff79a6f1, 0xe13ef6f4,
	0xe5ffeb43, 0xe8bccd9a, 0xec7dd02d, 0x34867077, 0x30476dc0,
	0x3d044b19, 0x39c556ae, 0x278206ab, 0x23431b1c, 0x2e003dc5,
	0x2ac12072, 0x128e9dcf, 0x164f8078, 0x1b0ca6a1, 0x1fcdbb16,
	0x018aeb13, 0x054bf6a4, 0x0808d07d, 0x0cc9cdca, 0x7897ab07,
	0x7c56b6b0, 0x71159069, 0x75d48dde, 0x6b93dddb, 0x6f52c06c,
	0x6211e6b5, 0x66d0fb02, 0x5e9f46bf, 0x5a5e5b08, 0x571d7dd1,
	0x53dc6066, 0x4d9b3063, 0x495a2dd4, 0x44190b0d, 0x40d816ba,
	0xaca5c697, 0xa864db20, 0xa527fdf9, 0xa1e6e04e, 0xbfa1b04b,
	0xbb60adfc, 0xb6238b25, 0xb2e29692, 0x8aad2b2f, 0x8e6c3698,
	0x832f1041, 0x87ee0df6, 0x99a95df3, 0x9d684044, 0x902b669d,
	0x94ea7b2a, 0xe0b41de7, 0xe4750050, 0xe9362689, 0xedf73b3e,
	0xf3b06b3b, 0xf771768c, 0xfa325055, 0xfef34de2, 0xc6bcf05f,
	0xc27dede8, 0xcf3ecb31, 0xcbffd686, 0xd5b88683, 0xd1799b34,
	0xdc3abded, 0xd8fba05a, 0x690ce0ee, 0x6dcdfd59, 0x608edb80,
	0x644fc637, 0x7a089632, 0x7ec98b85, 0x738aad5c, 0x774bb0eb,
	0x4f040d56, 0x4bc510e1, 0x46863638, 0x42472b8f, 0x5c007b8a,
	0x58c1663d, 0x558240e4, 0x51435d53, 0x251d3b9e, 0x21dc2629,
	0x2c9f00f0, 0x285e1d47, 0x36194d42, 0x32d850f5, 0x3f9b762c,
	0x3b5a6b9b, 0x0315d626, 0x07d4cb91, 0x0a97ed48, 0x0e56f0ff,
	0x1011a0fa, 0x14d0bd4d, 0x19939b94, 0x1d528623, 0xf12f560e,
	0xf5ee4bb9, 0xf8ad6d60, 0xfc6c70d7, 0xe22b20d2, 0xe6ea3d65,
	0xeba91bbc, 0xef68060b, 0xd727bbb6, 0xd3e6a601, 0xdea580d8,
	0xda649d6f, 0xc423cd6a, 0xc0e2d0dd, 0xcda1f604, 0xc960ebb3,
	0xbd3e8d7e, 0xb9ff90c9, 0xb4bcb610, 0xb07daba7, 0xae3afba2,
	0xaafbe615, 0xa7b8c0cc, 0xa379dd7b, 0x9b3660c6, 0x9ff77d71,
	0x92b45ba8, 0x9675461f, 0x8832161a, 0x8cf30bad, 0x81b02d74,
	0x857130c3, 0x5d8a9099, 0x594b8d2e, 0x5408abf7, 0x50c9b640,
	0x4e8ee645, 0x4a4ffbf2, 0x470cdd2b, 0x43cdc09c, 0x7b827d21,
	0x7f436096, 0x7200464f, 0x76c15bf8, 0x68860bfd, 0x6c47164a,
	0x61043093, 0x65c52d24, 0x119b4be9, 0x155a565e, 0x18197087,
	0x1cd86d30, 0x029f3d35, 0x065e2082, 0x0b1d065b, 0x0fdc1bec,
	0x3793a651, 0x3352bbe6, 0x3e119d3f, 0x3ad08088, 0x2497d08d,
	0x2056cd3a, 0x2d15ebe3, 0x29d4f654, 0xc5a92679, 0xc1683bce,
	0xcc2b1d17, 0xc8ea00a0, 0xd6ad50a5, 0xd26c4d12, 0xdf2f6bcb,
	0xdbee767c, 0xe3a1cbc1, 0xe760d676, 0xea23f0af, 0xeee2ed18,
	0xf0a5bd1d, 0xf464a0aa, 0xf9278673, 0xfde69bc4, 0x89b8fd09,
	0x8d79e0be, 0x803ac667, 0x84fbdbd0, 0x9abc8bd5, 0x9e7d9662,
	0x933eb0bb, 0x97ffad0c, 0xafb010b1, 0xab710d06, 0xa6322bdf,
	0xa2f33668, 0xbcb4666d, 0xb8757bda, 0xb5365d03, 0xb1f740b4
};

/*
 * Compute a POSIX 1003.2 checksum.  This routine has been broken out so that
 * other programs can use it.  It takes a char pointer and length.
 * It ruturns the crc value for the data in buf.
 */

u_long
crc(buf, clen)
	u_char	*buf;
	u_long	clen;
{
	register u_char *p;
	register u_long crc, len;

#define	COMPUTE(var, ch) (var) = (((var) << 8) ^ \
		crctab[(((var) >> 24) & 0xff) ^ (ch)]) & 0xffffffff

	for (crc=0, len=clen, p = buf; len--; ++p) {
		COMPUTE(crc, *p);
	}

	/* Include the length of the file. */
	for (; clen != 0; clen >>= 8) {
		COMPUTE(crc, clen & 0xff);
	}

	return (~crc & 0xffffffff);
}
/*
**	END of included source
*/

/*
**	Generate a sequence number for a packet.
*/
static
int
next_seq(seq)
    int		*seq;
{
	(*seq)++;
	if (*seq < 0) {		/* had a rollover */
		errno = EFBIG;
		return -1;
	}

	return 0;
}

/*
**	Put a human readable representation of a network addres into
**	a staticly allocated string.
*/
char *
netaddr(ap)
    struct sockaddr_in *ap;
{
	static	char	out[80];
	u_long		ipadd;

	if (ap == NULL)
		return "unknown";

	ipadd = ntohl(ap->sin_addr.s_addr);

	sprintf(out, "%ld.%ld.%ld.%ld:%d",
		(ipadd & 0xff000000) >> 24,
		(ipadd & 0x00ff0000) >> 16,
		(ipadd & 0x0000ff00) >> 8,
		(ipadd & 0x000000ff),
		ntohs(ap->sin_port));
	return out;
}

/*
**	Create a packet of the given type, fill in the sequence and
**	index number.  If buf is NULL, malloc an area for just
**	a header.  If buf is not NULL, it should contain space
**	for len+RPP_PKT_HEADER bytes.
*/
static
void
rpp_form_pkt(index, type, seq, buf, len)
    int		index;
    int		type;
    int		seq;
    u_char	*buf;
    int		len;
{
	DOID("form_pkt")
	struct	send_packet	*pktp;
	struct	stream		*sp;

	DBPRT((DBTO, "%s: index %d type %d seq %d len %d\n",
		id, index, type, seq, len))
	sp = &stream_array[index];
	pktp = (struct send_packet *)malloc(sizeof(struct send_packet));
	assert(pktp != NULL);

	pktp->type = type;
	pktp->sequence = seq;
	pktp->time_sent = 0;
	pktp->sent_out = 0;
	pktp->len = len;
	pktp->index = index;

	if (buf)
		pktp->data = (u_char *)realloc(buf, len+RPP_PKT_HEAD);
	else
		pktp->data = (u_char *)malloc(RPP_PKT_HEAD);
	assert(pktp->data != NULL);
	/*
	** Put on stream send list
	*/
	if (sp->send_head == NULL)
		sp->send_head = pktp;
	else
		sp->send_tail->next = pktp;
	sp->send_tail = pktp;
	pktp->next = NULL;
	pktp->down = NULL;

	/*
	** if open has not completed yet, hold off putting on send queue
	*/
	if (sp->stream_id == -1) {
		pktp->up = NULL;
		return;
	}
	/*
	** if the stream is fully open, format and put on the send queue
	*/
	DBPRT((DBTO, "%s: idx %d link %d seq %d len %d to sendq\n",
		id, index, type, seq, len))

	I2TOH(type, (char *)&pktp->data[len])
	I8TOH(sp->stream_id, (char *)&pktp->data[len+RPP_HDR_SID])
	I8TOH(seq, (char *)&pktp->data[len+RPP_HDR_SEQ])
	I8TOH(crc(pktp->data, (u_long)(len+RPP_PKT_CRC)),
		(char *)&pktp->data[len+RPP_PKT_CRC])

	if (bottom)
		bottom->down = pktp;
	pktp->up = bottom;
	if (top == NULL)		/* first one */
		top = pktp;
	bottom = pktp;
	return;
}

/*
**	Check to make sure an incoming packet goes with one of the
**	streams we have.
*/
static
struct	stream	*
rpp_check_pkt(index, addrp)
    int		index;
    struct	sockaddr_in	*addrp;
{
	DOID("check_pkt")
	struct	stream	*sp;
	struct	in_addr	*addrs;
	int		i;

	if (index < 0 || index >= stream_num) {
		DBPRT((DBTO, "%s: BAD INDEX %d outside limit %d\n",
			id, index, stream_num))
		return NULL;
	}

	sp = &stream_array[index];
	if (sp->state <= RPP_FREE) {
		DBPRT((DBTO, "%s: FREE STREAM\n", id))
		return NULL;
	}

	if (addrp->sin_port != sp->addr.sin_port)
		goto bad;
	if (addrp->sin_family != sp->addr.sin_family)
		goto bad;
	if (addrp->sin_addr.s_addr == sp->addr.sin_addr.s_addr)
		return sp;

	if ((addrs = sp->addr_array) != NULL) {
		for (i=0; addrs[i].s_addr; i++) {
			if (addrs[i].s_addr == addrp->sin_addr.s_addr)
				return sp;
		}
	}

  bad:
	DBPRT((DBTO, "%s: ADDRESS MISMATCH\n", id))
	DBPRT((DBTO, "\tstream %d addr %s\n", index, netaddr(&sp->addr)))
	DBPRT((DBTO, "\tpkt addr %s\n", netaddr(addrp)))
	return NULL;
}

/*
**	Send outstanding information starting with top and working
**	down to bottom.  Will not cause state change.
*/
static
void
rpp_send_out()
{
	DOID("send_out")
	struct	send_packet	*pp;
	struct	stream		*sp;
	time_t			curr;

	curr = time(NULL);
	for (pp = top; pp; pp = pp->down) {
		int	sitting = curr - pp->time_sent;

		if (sitting < RPP_TIMEOUT)
			continue;
		if (pp->time_sent == 0 &&
				pkts_sent >= RPP_HIGHWATER)
			break;

		sp = &stream_array[pp->index];
		DBPRT((DBTO,
			"%s index %d type %d sent %d seq %d to %s crc %8.8s\n",
			id, pp->index, pp->type,
			pp->sent_out, pp->sequence, netaddr(&sp->addr),
			(char *)&pp->data[pp->len+RPP_PKT_CRC]))
		if (sendto(sp->fd, (char *)pp->data, RPP_PKT_HEAD+pp->len,
				0, (struct sockaddr *)&sp->addr,
				sizeof(struct sockaddr_in)) == -1) {
			DBPRT((DBTO, "%s: SENDTO errno %d\n", id, errno))
			pp->sent_out++;
			continue;
		}

		if (pp->time_sent == 0)		/* new one */
			pkts_sent++;

		pp->time_sent = curr;
		pp->sent_out++;
	}
	return;
}

/*
**	Create or reuse a possition in stream_array.
*/
static
int
rpp_create_sp()
{
	int	i;
	struct	stream	*sp;

	if (stream_array == NULL) {
		stream_array = (struct stream *)malloc(sizeof(struct stream));
		if (stream_array == NULL)
			return -1;
		memset(stream_array, '\0', sizeof(struct stream));
		stream_num = 1;
	}
	for (i=0; i<stream_num; i++) {
		sp = &stream_array[i];

		if (sp->state == RPP_FREE)
			break;
	}
	if (i == stream_num) {
		for (i=0; i<stream_num; i++) {
			sp = &stream_array[i];

			if (sp->state == RPP_DEAD)
				break;
		}
	}
	if (i == stream_num) {		/* none available */
		sp = (struct stream *)realloc((void *)stream_array,
					(stream_num*2)*sizeof(struct stream));
		if (sp == NULL) {
			sp = (struct stream *)realloc((void *)stream_array,
					(stream_num+1)*sizeof(struct stream));
			if (sp == NULL)
				return -1;
			stream_num++;
		}
		else
			stream_num *= 2;
		stream_array = sp;
		sp = &stream_array[i];
		memset((void *)sp, '\0', (stream_num-i)*sizeof(struct stream));
	}
	else
		memset((void *)sp, '\0', sizeof(struct stream));
	DBPRT((DBTO, "rpp_create_sp: new index %d\n", i))
	return i;
}

/*
**	Look up the "canonical" name for the host by
**	calling gethostbyaddr with an IP address.
*/
static
struct	hostent		*
rpp_get_cname(addr)
    struct	sockaddr_in	*addr;
{
	DOID("get_cname")
	struct	hostent		*hp;
	char			*hname;

	if ((hp = gethostbyaddr((void *)&addr->sin_addr,
				sizeof(struct in_addr),
				addr->sin_family)) == NULL) {
		DBPRT((DBTO, "%s: addr not found, h_errno=%d errno=%d\n",
				id, h_errno, errno))
		return NULL;
	}
	if ((hname = (char *)strdup(hp->h_name)) == NULL)
		return NULL;

	if ((hp = gethostbyname(hname)) == NULL) {
		DBPRT((DBTO, "%s: canonical name %s not found, h_errno=%d errno=%d\n",
				id, hname, h_errno, errno))