1*5b133f3fSguenther /* $OpenBSD: hist.c,v 1.11 2023/03/08 04:43:04 guenther Exp $ */
2df930be7Sderaadt /* $NetBSD: hist.c,v 1.7 1995/03/21 18:35:44 mycroft Exp $ */
3df930be7Sderaadt
4df930be7Sderaadt /*-
5df930be7Sderaadt * Copyright (c) 1980, 1991, 1993
6df930be7Sderaadt * The Regents of the University of California. All rights reserved.
7df930be7Sderaadt *
8df930be7Sderaadt * Redistribution and use in source and binary forms, with or without
9df930be7Sderaadt * modification, are permitted provided that the following conditions
10df930be7Sderaadt * are met:
11df930be7Sderaadt * 1. Redistributions of source code must retain the above copyright
12df930be7Sderaadt * notice, this list of conditions and the following disclaimer.
13df930be7Sderaadt * 2. Redistributions in binary form must reproduce the above copyright
14df930be7Sderaadt * notice, this list of conditions and the following disclaimer in the
15df930be7Sderaadt * documentation and/or other materials provided with the distribution.
1629295d1cSmillert * 3. Neither the name of the University nor the names of its contributors
17df930be7Sderaadt * may be used to endorse or promote products derived from this software
18df930be7Sderaadt * without specific prior written permission.
19df930be7Sderaadt *
20df930be7Sderaadt * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21df930be7Sderaadt * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22df930be7Sderaadt * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23df930be7Sderaadt * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24df930be7Sderaadt * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25df930be7Sderaadt * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26df930be7Sderaadt * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27df930be7Sderaadt * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28df930be7Sderaadt * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29df930be7Sderaadt * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30df930be7Sderaadt * SUCH DAMAGE.
31df930be7Sderaadt */
32df930be7Sderaadt
33df930be7Sderaadt #include <sys/types.h>
34df930be7Sderaadt #include <stdlib.h>
35df930be7Sderaadt #include <stdarg.h>
36df930be7Sderaadt
37df930be7Sderaadt #include "csh.h"
38df930be7Sderaadt #include "extern.h"
39df930be7Sderaadt
40c72b5b24Smillert static void hfree(struct Hist *);
41c72b5b24Smillert static void dohist1(struct Hist *, int *, int, int);
42c72b5b24Smillert static void phist(struct Hist *, int);
43df930be7Sderaadt
44df930be7Sderaadt void
savehist(struct wordent * sp)45e757c91eSderaadt savehist(struct wordent *sp)
46df930be7Sderaadt {
47e757c91eSderaadt struct Hist *hp, *np;
48e757c91eSderaadt int histlen = 0;
49df930be7Sderaadt Char *cp;
50df930be7Sderaadt
51df930be7Sderaadt /* throw away null lines */
52df930be7Sderaadt if (sp->next->word[0] == '\n')
53df930be7Sderaadt return;
54df930be7Sderaadt cp = value(STRhistory);
55df930be7Sderaadt if (*cp) {
56e757c91eSderaadt Char *p = cp;
57df930be7Sderaadt
58df930be7Sderaadt while (*p) {
59df930be7Sderaadt if (!Isdigit(*p)) {
60df930be7Sderaadt histlen = 0;
61df930be7Sderaadt break;
62df930be7Sderaadt }
63df930be7Sderaadt histlen = histlen * 10 + *p++ - '0';
64df930be7Sderaadt }
65df930be7Sderaadt }
66df930be7Sderaadt for (hp = &Histlist; (np = hp->Hnext) != NULL;)
67df930be7Sderaadt if (eventno - np->Href >= histlen || histlen == 0)
68df930be7Sderaadt hp->Hnext = np->Hnext, hfree(np);
69df930be7Sderaadt else
70df930be7Sderaadt hp = np;
71df930be7Sderaadt (void) enthist(++eventno, sp, 1);
72df930be7Sderaadt }
73df930be7Sderaadt
74df930be7Sderaadt struct Hist *
enthist(int event,struct wordent * lp,bool docopy)75e757c91eSderaadt enthist(int event, struct wordent *lp, bool docopy)
76df930be7Sderaadt {
77e757c91eSderaadt struct Hist *np;
78df930be7Sderaadt
79df930be7Sderaadt np = (struct Hist *) xmalloc((size_t) sizeof(*np));
80df930be7Sderaadt np->Hnum = np->Href = event;
81df930be7Sderaadt if (docopy) {
82df930be7Sderaadt copylex(&np->Hlex, lp);
83df930be7Sderaadt }
84df930be7Sderaadt else {
85df930be7Sderaadt np->Hlex.next = lp->next;
86df930be7Sderaadt lp->next->prev = &np->Hlex;
87df930be7Sderaadt np->Hlex.prev = lp->prev;
88df930be7Sderaadt lp->prev->next = &np->Hlex;
89df930be7Sderaadt }
90df930be7Sderaadt np->Hnext = Histlist.Hnext;
91df930be7Sderaadt Histlist.Hnext = np;
92df930be7Sderaadt return (np);
93df930be7Sderaadt }
94df930be7Sderaadt
95df930be7Sderaadt static void
hfree(struct Hist * hp)96e757c91eSderaadt hfree(struct Hist *hp)
97df930be7Sderaadt {
98df930be7Sderaadt
99df930be7Sderaadt freelex(&hp->Hlex);
100acdb3202Smestre free(hp);
101df930be7Sderaadt }
102df930be7Sderaadt
103df930be7Sderaadt void
dohist(Char ** v,struct command * t)104e757c91eSderaadt dohist(Char **v, struct command *t)
105df930be7Sderaadt {
106df930be7Sderaadt int n, rflg = 0, hflg = 0;
107df930be7Sderaadt sigset_t sigset;
108df930be7Sderaadt
109df930be7Sderaadt if (getn(value(STRhistory)) == 0)
110df930be7Sderaadt return;
111df930be7Sderaadt if (setintr) {
112df930be7Sderaadt sigemptyset(&sigset);
113df930be7Sderaadt sigaddset(&sigset, SIGINT);
114df930be7Sderaadt sigprocmask(SIG_UNBLOCK, &sigset, NULL);
115df930be7Sderaadt }
116df930be7Sderaadt while (*++v && **v == '-') {
117df930be7Sderaadt Char *vp = *v;
118df930be7Sderaadt
119df930be7Sderaadt while (*++vp)
120df930be7Sderaadt switch (*vp) {
121df930be7Sderaadt case 'h':
122df930be7Sderaadt hflg++;
123df930be7Sderaadt break;
124df930be7Sderaadt case 'r':
125df930be7Sderaadt rflg++;
126df930be7Sderaadt break;
127df930be7Sderaadt case '-': /* ignore multiple '-'s */
128df930be7Sderaadt break;
129df930be7Sderaadt default:
130df930be7Sderaadt stderror(ERR_HISTUS);
131df930be7Sderaadt break;
132df930be7Sderaadt }
133df930be7Sderaadt }
134df930be7Sderaadt if (*v)
135df930be7Sderaadt n = getn(*v);
136df930be7Sderaadt else {
137df930be7Sderaadt n = getn(value(STRhistory));
138df930be7Sderaadt }
139df930be7Sderaadt dohist1(Histlist.Hnext, &n, rflg, hflg);
140df930be7Sderaadt }
141df930be7Sderaadt
142df930be7Sderaadt static void
dohist1(struct Hist * hp,int * np,int rflg,int hflg)143e757c91eSderaadt dohist1(struct Hist *hp, int *np, int rflg, int hflg)
144df930be7Sderaadt {
145df930be7Sderaadt bool print = (*np) > 0;
146df930be7Sderaadt
147df930be7Sderaadt for (; hp != 0; hp = hp->Hnext) {
148df930be7Sderaadt (*np)--;
149df930be7Sderaadt hp->Href++;
150df930be7Sderaadt if (rflg == 0) {
151df930be7Sderaadt dohist1(hp->Hnext, np, rflg, hflg);
152df930be7Sderaadt if (print)
153df930be7Sderaadt phist(hp, hflg);
154df930be7Sderaadt return;
155df930be7Sderaadt }
156df930be7Sderaadt if (*np >= 0)
157df930be7Sderaadt phist(hp, hflg);
158df930be7Sderaadt }
159df930be7Sderaadt }
160df930be7Sderaadt
161df930be7Sderaadt static void
phist(struct Hist * hp,int hflg)162e757c91eSderaadt phist(struct Hist *hp, int hflg)
163df930be7Sderaadt {
164df930be7Sderaadt if (hflg == 0)
165df930be7Sderaadt (void) fprintf(cshout, "%6d\t", hp->Hnum);
166df930be7Sderaadt prlex(cshout, &hp->Hlex);
167df930be7Sderaadt }
168