Return to rx.c CVS log

Up to [Research Unix] / researchv9 / ipc / src / bin

researchv9-SUN3(old)

#include <stdio.h>
#include <dk.h>
#include <string.h>
#include <sys/types.h>
#include <libc.h>
#include <ipc.h>

/*
 * program to run a command
 * on another cpu on Datakit
 */

#define MAXCHARS 8192
char	args[MAXCHARS];
char	buf[4096];
char	*bldargs(), *malloc();
extern	errno;
fd_set	rbits, bits;

#define	MAXEOF	10

main(argc, argv)
char **argv;
{
	char *host, *av0;
	register int rem, n;
	register int neof;

	rem = -1;
	av0 = host = argv[0];
	if (strrchr(av0, '/'))
		av0 = host = strrchr(av0, '/')+1;
	if(strcmp(host, "rx")==0 || strcmp(host, "rsh")==0){
		host = argv[1];
		argv++;
		argc--;
	}
	else if(argc<=1){
		execl("/usr/ipc/bin/con", "con", host, 0);
		execl("/bin/dcon", "dcon", host, 0);
		fprintf(stderr, "rx: cannot exec dcon\n");
		exit(1);
	}
	if (strcmp(av0, "rsh")!=0)
		rem = ipcexec(host, "heavy", bldargs(argc-1, &argv[1]));
	if (rem<0)
		rem = ipcrexec(host, "heavy", bldargs(argc-1, &argv[1]));
	if (rem<0) {
		fprintf(stderr, "%s: call to %s failed: %s\n", av0, host, errstr);
		exit(1);
	}
	FD_SET(0, bits);
	FD_SET(rem, bits);
	neof = 0;
	for (;;) {
		rbits = bits;
		if (select(rem+1, &rbits, (fd_set *)NULL, 20000) < 0)
			exit(1);
		if (FD_ISSET(0, rbits)) {
			n = read(0, buf, sizeof(buf));
			if (n > 0) {
				if (write(rem, buf, n) != n)
					exit(1);
				neof = 0;
			}
			else {
				if (++neof >= MAXEOF)
					FD_CLR(0, bits);
				write(rem, buf, 0);
			}
		}
		if (FD_ISSET(rem, rbits)) {
			n = read(rem, buf, sizeof(buf));
			if (n <= 0)
				exit(0);
			if (write(1, buf, n) != n)
				exit(1);
		}
	}
}

char *
bldargs(argc, argv)
register char **argv;
{
	register char *s = args, *t;

	while(argc--) {
		*s++ = ' ';
		t = *argv++;
		while(*s = *t++) {
			if(s++ >= &args[MAXCHARS-2]){
				fprintf(stderr, "rx: arg list too long\n");
				exit(1);
			}
		}
	}
	*s = '\0';
	return(args+1);
}

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.