[unix-history] / usr / src / bin / csh / hist.c

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.  The Berkeley Software License Agreement
 * specifies the terms and conditions for redistribution.
 */

#ifndef lint
static char *sccsid = "@(#)hist.c	5.3 (Berkeley) %G%";
#endif

#include "sh.h"

/*
 * C shell
 */

savehist(sp)
	struct wordent *sp;
{
	register struct Hist *hp, *np;
	register int histlen = 0;
	char *cp;

	/* throw away null lines */
	if (sp->next->word[0] == '\n')
		return;
	cp = value("history");
	if (*cp) {
		register char *p = cp;

		while (*p) {
			if (!digit(*p)) {
				histlen = 0;
				break;
			}
			histlen = histlen * 10 + *p++ - '0';
		}
	}
	for (hp = &Histlist; np = hp->Hnext;)
		if (eventno - np->Href >= histlen || histlen == 0)
			hp->Hnext = np->Hnext, hfree(np);
		else
			hp = np;
	(void) enthist(++eventno, sp, 1);
}

struct Hist *
enthist(event, lp, docopy)
	int event;
	register struct wordent *lp;
	bool docopy;
{
	register struct Hist *np;

	np = (struct Hist *) xalloc(sizeof *np);
	np->Hnum = np->Href = event;
	if (docopy)
		copylex(&np->Hlex, lp);
	else {
		np->Hlex.next = lp->next;
		lp->next->prev = &np->Hlex;
		np->Hlex.prev = lp->prev;
		lp->prev->next = &np->Hlex;
	}
	np->Hnext = Histlist.Hnext;
	Histlist.Hnext = np;
	return (np);
}

hfree(hp)
	register struct Hist *hp;
{

	freelex(&hp->Hlex);
	xfree((char *)hp);
}

dohist(vp)
	char **vp;
{
	int n, rflg = 0, hflg = 0;
	if (getn(value("history")) == 0)
		return;
	if (setintr)
		(void) sigsetmask(sigblock(0L) & ~sigmask(SIGINT));
 	while (*++vp && **vp == '-') {
 		char *vp2 = *vp;
 
 		while (*++vp2)
 			switch (*vp2) {
 			case 'h':
 				hflg++;
 				break;
 			case 'r':
 				rflg++;
 				break;
 			case '-':	/* ignore multiple '-'s */
 				break;
 			default:
 				printf("Unknown flag: -%c\n", *vp2);
 				error("Usage: history [-rh] [# number of events]");
			}
	}
	if (*vp)
		n = getn(*vp);
	else {
		n = getn(value("history"));
	}
	dohist1(Histlist.Hnext, &n, rflg, hflg);
}

dohist1(hp, np, rflg, hflg)
	struct Hist *hp;
	int *np, rflg, hflg;
{
	bool print = (*np) > 0;
top:
	if (hp == 0)
		return;
	(*np)--;
	hp->Href++;
	if (rflg == 0) {
		dohist1(hp->Hnext, np, rflg, hflg);
		if (print)
			phist(hp, hflg);
		return;
	}
	if (*np >= 0)
		phist(hp, hflg);
	hp = hp->Hnext;
	goto top;
}

phist(hp, hflg)
	register struct Hist *hp;
	int hflg;
{

	if (hflg == 0)
		printf("%6d\t", hp->Hnum);
	prlex(&hp->Hlex);
}
Commit	Line	Data
b79f4fa9 DF	1	/*
b79f4fa9 DF	2	* Copyright (c) 1980 Regents of the University of California.
094e80ed	3	* All rights reserved. The Berkeley Software License Agreement
b79f4fa9 DF	4	* specifies the terms and conditions for redistribution.
	5	*/
	6
35371dec	7	#ifndef lint
1f7b623f	8	static char *sccsid = "@(#)hist.c 5.3 (Berkeley) %G%";
094e80ed	9	#endif
91a455c6 BJ	10
	11	#include "sh.h"
	12
	13	/*
	14	* C shell
	15	*/
	16
	17	savehist(sp)
	18	struct wordent *sp;
	19	{
	20	register struct Hist hp, np;
35371dec EW	21	register int histlen = 0;
35371dec EW	22	char *cp;
91a455c6	23
91a455c6 BJ	24	/* throw away null lines */
	25	if (sp->next->word[0] == '\n')
	26	return;
35371dec EW	27	cp = value("history");
	28	if (*cp) {
	29	register char *p = cp;
	30
	31	while (*p) {
	32	if (!digit(*p)) {
	33	histlen = 0;
	34	break;
	35	}
	36	histlen = histlen * 10 + *p++ - '0';
	37	}
	38	}
91a455c6 BJ	39	for (hp = &Histlist; np = hp->Hnext;)
	40	if (eventno - np->Href >= histlen \|\| histlen == 0)
	41	hp->Hnext = np->Hnext, hfree(np);
	42	else
	43	hp = np;
35371dec	44	(void) enthist(++eventno, sp, 1);
91a455c6 BJ	45	}
	46
	47	struct Hist *
	48	enthist(event, lp, docopy)
	49	int event;
	50	register struct wordent *lp;
	51	bool docopy;
	52	{
	53	register struct Hist *np;
	54
35371dec	55	np = (struct Hist ) xalloc(sizeof np);
91a455c6 BJ	56	np->Hnum = np->Href = event;
	57	if (docopy)
	58	copylex(&np->Hlex, lp);
	59	else {
	60	np->Hlex.next = lp->next;
	61	lp->next->prev = &np->Hlex;
	62	np->Hlex.prev = lp->prev;
	63	lp->prev->next = &np->Hlex;
	64	}
	65	np->Hnext = Histlist.Hnext;
	66	Histlist.Hnext = np;
	67	return (np);
	68	}
	69
	70	hfree(hp)
	71	register struct Hist *hp;
	72	{
	73
	74	freelex(&hp->Hlex);
	75	xfree((char *)hp);
	76	}
	77
	78	dohist(vp)
	79	char **vp;
	80	{
d7929fa7	81	int n, rflg = 0, hflg = 0;
91a455c6 BJ	82	if (getn(value("history")) == 0)
	83	return;
	84	if (setintr)
1f7b623f	85	(void) sigsetmask(sigblock(0L) & ~sigmask(SIGINT));
a8dfd89b KM	86	while (++vp && *vp == '-') {
	87	char vp2 = vp;
	88
	89	while (*++vp2)
	90	switch (*vp2) {
	91	case 'h':
	92	hflg++;
	93	break;
	94	case 'r':
	95	rflg++;
	96	break;
	97	case '-': /* ignore multiple '-'s */
	98	break;
	99	default:
	100	printf("Unknown flag: -%c\n", *vp2);
	101	error("Usage: history [-rh] [# number of events]");
	102	}
91a455c6 BJ	103	}
	104	if (*vp)
	105	n = getn(*vp);
d7929fa7 KM	106	else {
	107	n = getn(value("history"));
	108	}
	109	dohist1(Histlist.Hnext, &n, rflg, hflg);
91a455c6 BJ	110	}
91a455c6 BJ	111
d7929fa7	112	dohist1(hp, np, rflg, hflg)
91a455c6	113	struct Hist *hp;
d7929fa7	114	int *np, rflg, hflg;
91a455c6 BJ	115	{
	116	bool print = (*np) > 0;
	117	top:
	118	if (hp == 0)
	119	return;
	120	(*np)--;
	121	hp->Href++;
	122	if (rflg == 0) {
d7929fa7	123	dohist1(hp->Hnext, np, rflg, hflg);
91a455c6	124	if (print)
d7929fa7	125	phist(hp, hflg);
91a455c6 BJ	126	return;
	127	}
	128	if (*np >= 0)
d7929fa7	129	phist(hp, hflg);
91a455c6 BJ	130	hp = hp->Hnext;
	131	goto top;
	132	}
	133
d7929fa7	134	phist(hp, hflg)
91a455c6	135	register struct Hist *hp;
d7929fa7	136	int hflg;
91a455c6 BJ	137	{
91a455c6 BJ	138
d7929fa7	139	if (hflg == 0)
63af20f7	140	printf("%6d\t", hp->Hnum);
91a455c6 BJ	141	prlex(&hp->Hlex);
91a455c6 BJ	142	}