xref: /src/usr.bin/systat/cmds.c

/*	$NetBSD: cmds.c,v 1.12 1999/12/16 04:49:32 jwise Exp $	*/

/*-
 * Copyright (c) 1980, 1992, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * 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 acknowledgement:
 *	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.
 */

#include <sys/cdefs.h>
#ifndef lint
#if 0
static char sccsid[] = "@(#)cmds.c	8.2 (Berkeley) 4/29/95";
#endif
__RCSID("$NetBSD: cmds.c,v 1.12 1999/12/16 04:49:32 jwise Exp $");
#endif /* not lint */

#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <ctype.h>
#include <string.h>
#include "systat.h"
#include "extern.h"

void
command(cmd)
	char *cmd;
{
	struct command *c;
	struct mode *p;
	char *cp;
	int interval;
	sigset_t set;

	sigemptyset(&set);
	sigaddset(&set, SIGALRM);
	sigprocmask(SIG_BLOCK, &set, NULL);
	for (cp = cmd; *cp && !isspace((unsigned char)*cp); cp++)
		;
	if (*cp)
		*cp++ = '\0';
	if (*cmd == '\0')
		return;
	for (; *cp && isspace((unsigned char)*cp); cp++)
		;

	for (c = global_commands; c->c_name; c++) {
		if (strcmp(cmd, c->c_name) == 0) {
			(c->c_cmd)(cp);
			goto done;
		}
	}

	interval = atoi(cmd);
	if (interval <= 0 &&
	    (strcmp(cmd, "start") == 0 || strcmp(cmd, "interval") == 0)) {
		interval = *cp ? atoi(cp) : naptime;
		if (interval <= 0) {
			error("%d: bad interval.", interval);
			goto done;
		}
	}
	if (interval > 0) {
		alarm(0);
		naptime = interval;
		display(0);
		status();
		goto done;
	}
	p = lookup(cmd);
	if (p == (struct mode *)-1) {
		error("%s: Ambiguous command.", cmd);
		goto done;
	}
	if (p) {
		if (curmode == p)
			goto done;
		alarm(0);
		(*curmode->c_close)(wnd);
		wnd = (*p->c_open)();
		if (wnd == 0) {
			error("Couldn't open new display");
			wnd = (*curmode->c_open)();
			if (wnd == 0) {
				error("Couldn't change back to previous cmd");
				exit(1);
			}
			p = curmode;
		}
		if ((p->c_flags & CF_INIT) == 0) {
			if ((*p->c_init)())
				p->c_flags |= CF_INIT;
			else
				goto done;
		}
		curmode = p;
		labels();
		display(0);
		status();
		goto done;
	}
	if (curmode->c_cmd == 0 || !(*curmode->c_cmd)(cmd, cp))
		error("%s: Unknown command.", cmd);
done:
	sigprocmask(SIG_UNBLOCK, &set, NULL);
}

struct mode *
lookup(name)
	char *name;
{
	char *p, *q;
	struct mode *c, *found;
	int nmatches, longest;

	longest = 0;
	nmatches = 0;
	found = (struct mode *) 0;
	for (c = modes; (p = c->c_name); c++) {
		for (q = name; *q == *p++; q++)
			if (*q == 0)		/* exact match? */
				return (c);
		if (!*q) {			/* the name was a prefix */
			if (q - name > longest) {
				longest = q - name;
				nmatches = 1;
				found = c;
			} else if (q - name == longest)
				nmatches++;
		}
	}
	if (nmatches > 1)
		return ((struct mode *)-1);
	return (found);
}

void
status()
{
	error("Showing %s, refresh every %d seconds.", curmode->c_name, naptime);
}

/* case insensitive prefix comparison */
int
prefix(s1, s2)
	char *s1, *s2;
{
	char c1, c2;

	while (1) {
		c1 = *s1 >= 'A' && *s1 <= 'Z' ? *s1 + 'a' - 'A' : *s1;
		c2 = *s2 >= 'A' && *s2 <= 'Z' ? *s2 + 'a' - 'A' : *s2;
		if (c1 != c2)
			break;
		if (c1 == '\0')
			return (1);
		s1++, s2++;
	}
	return (*s1 == '\0');
}