Home | History | Annotate | Line # | Download | only in csh
hist.c revision 1.1.1.1
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1980, 1991 The Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd static char sccsid[] = "@(#)hist.c	5.9 (Berkeley) 6/8/91";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd #include <sys/types.h>
     39  1.1  cgd #include <stdlib.h>
     40  1.1  cgd #if __STDC__
     41  1.1  cgd # include <stdarg.h>
     42  1.1  cgd #else
     43  1.1  cgd # include <varargs.h>
     44  1.1  cgd #endif
     45  1.1  cgd 
     46  1.1  cgd #include "csh.h"
     47  1.1  cgd #include "extern.h"
     48  1.1  cgd 
     49  1.1  cgd static void	hfree __P((struct Hist *));
     50  1.1  cgd static void	dohist1 __P((struct Hist *, int *, int, int, int));
     51  1.1  cgd static void	phist __P((struct Hist *, int, int));
     52  1.1  cgd 
     53  1.1  cgd void
     54  1.1  cgd savehist(sp)
     55  1.1  cgd     struct wordent *sp;
     56  1.1  cgd {
     57  1.1  cgd     register struct Hist *hp, *np;
     58  1.1  cgd     register int histlen = 0;
     59  1.1  cgd     Char   *cp;
     60  1.1  cgd 
     61  1.1  cgd     /* throw away null lines */
     62  1.1  cgd     if (sp->next->word[0] == '\n')
     63  1.1  cgd 	return;
     64  1.1  cgd     cp = value(STRhistory);
     65  1.1  cgd     if (*cp) {
     66  1.1  cgd 	register Char *p = cp;
     67  1.1  cgd 
     68  1.1  cgd 	while (*p) {
     69  1.1  cgd 	    if (!Isdigit(*p)) {
     70  1.1  cgd 		histlen = 0;
     71  1.1  cgd 		break;
     72  1.1  cgd 	    }
     73  1.1  cgd 	    histlen = histlen * 10 + *p++ - '0';
     74  1.1  cgd 	}
     75  1.1  cgd     }
     76  1.1  cgd     for (hp = &Histlist; np = hp->Hnext;)
     77  1.1  cgd 	if (eventno - np->Href >= histlen || histlen == 0)
     78  1.1  cgd 	    hp->Hnext = np->Hnext, hfree(np);
     79  1.1  cgd 	else
     80  1.1  cgd 	    hp = np;
     81  1.1  cgd     (void) enthist(++eventno, sp, 1);
     82  1.1  cgd }
     83  1.1  cgd 
     84  1.1  cgd struct Hist *
     85  1.1  cgd enthist(event, lp, docopy)
     86  1.1  cgd     int     event;
     87  1.1  cgd     register struct wordent *lp;
     88  1.1  cgd     bool    docopy;
     89  1.1  cgd {
     90  1.1  cgd     register struct Hist *np;
     91  1.1  cgd 
     92  1.1  cgd     np = (struct Hist *) xmalloc((size_t) sizeof(*np));
     93  1.1  cgd     (void) time(&(np->Htime));
     94  1.1  cgd     np->Hnum = np->Href = event;
     95  1.1  cgd     if (docopy) {
     96  1.1  cgd 	copylex(&np->Hlex, lp);
     97  1.1  cgd     }
     98  1.1  cgd     else {
     99  1.1  cgd 	np->Hlex.next = lp->next;
    100  1.1  cgd 	lp->next->prev = &np->Hlex;
    101  1.1  cgd 	np->Hlex.prev = lp->prev;
    102  1.1  cgd 	lp->prev->next = &np->Hlex;
    103  1.1  cgd     }
    104  1.1  cgd     np->Hnext = Histlist.Hnext;
    105  1.1  cgd     Histlist.Hnext = np;
    106  1.1  cgd     return (np);
    107  1.1  cgd }
    108  1.1  cgd 
    109  1.1  cgd static void
    110  1.1  cgd hfree(hp)
    111  1.1  cgd     register struct Hist *hp;
    112  1.1  cgd {
    113  1.1  cgd 
    114  1.1  cgd     freelex(&hp->Hlex);
    115  1.1  cgd     xfree((ptr_t) hp);
    116  1.1  cgd }
    117  1.1  cgd 
    118  1.1  cgd void
    119  1.1  cgd dohist(vp)
    120  1.1  cgd     Char  **vp;
    121  1.1  cgd {
    122  1.1  cgd     int     n, rflg = 0, hflg = 0, tflg = 0;
    123  1.1  cgd 
    124  1.1  cgd     if (getn(value(STRhistory)) == 0)
    125  1.1  cgd 	return;
    126  1.1  cgd     if (setintr)
    127  1.1  cgd 	(void) sigsetmask(sigblock((sigset_t) 0) & ~sigmask(SIGINT));
    128  1.1  cgd     while (*++vp && **vp == '-') {
    129  1.1  cgd 	Char   *vp2 = *vp;
    130  1.1  cgd 
    131  1.1  cgd 	while (*++vp2)
    132  1.1  cgd 	    switch (*vp2) {
    133  1.1  cgd 	    case 'h':
    134  1.1  cgd 		hflg++;
    135  1.1  cgd 		break;
    136  1.1  cgd 	    case 'r':
    137  1.1  cgd 		rflg++;
    138  1.1  cgd 		break;
    139  1.1  cgd 	    case 't':
    140  1.1  cgd 		tflg++;
    141  1.1  cgd 		break;
    142  1.1  cgd 	    case '-':		/* ignore multiple '-'s */
    143  1.1  cgd 		break;
    144  1.1  cgd 	    default:
    145  1.1  cgd 		stderror(ERR_HISTUS);
    146  1.1  cgd 		break;
    147  1.1  cgd 	    }
    148  1.1  cgd     }
    149  1.1  cgd     if (*vp)
    150  1.1  cgd 	n = getn(*vp);
    151  1.1  cgd     else {
    152  1.1  cgd 	n = getn(value(STRhistory));
    153  1.1  cgd     }
    154  1.1  cgd     dohist1(Histlist.Hnext, &n, rflg, hflg, tflg);
    155  1.1  cgd }
    156  1.1  cgd 
    157  1.1  cgd static void
    158  1.1  cgd dohist1(hp, np, rflg, hflg, tflg)
    159  1.1  cgd     struct Hist *hp;
    160  1.1  cgd     int    *np, rflg, hflg, tflg;
    161  1.1  cgd {
    162  1.1  cgd     bool    print = (*np) > 0;
    163  1.1  cgd 
    164  1.1  cgd     for (; hp != 0; hp = hp->Hnext) {
    165  1.1  cgd 	(*np)--;
    166  1.1  cgd 	hp->Href++;
    167  1.1  cgd 	if (rflg == 0) {
    168  1.1  cgd 	    dohist1(hp->Hnext, np, rflg, hflg, tflg);
    169  1.1  cgd 	    if (print)
    170  1.1  cgd 		phist(hp, hflg, tflg);
    171  1.1  cgd 	    return;
    172  1.1  cgd 	}
    173  1.1  cgd 	if (*np >= 0)
    174  1.1  cgd 	    phist(hp, hflg, tflg);
    175  1.1  cgd     }
    176  1.1  cgd }
    177  1.1  cgd 
    178  1.1  cgd static void
    179  1.1  cgd phist(hp, hflg, tflg)
    180  1.1  cgd     register struct Hist *hp;
    181  1.1  cgd     int     hflg, tflg;
    182  1.1  cgd {
    183  1.1  cgd     struct tm *t;
    184  1.1  cgd     char    ampm = 'a';
    185  1.1  cgd 
    186  1.1  cgd     if (hflg == 0) {
    187  1.1  cgd 	xprintf("%6d\t", hp->Hnum);
    188  1.1  cgd 	if (tflg == 0) {
    189  1.1  cgd 	    t = localtime(&hp->Htime);
    190  1.1  cgd 	    if (adrof(STRampm)) {	/* addition by Hans J. Albertsson */
    191  1.1  cgd 		if (t->tm_hour >= 12) {
    192  1.1  cgd 		    if (t->tm_hour > 12)
    193  1.1  cgd 			t->tm_hour -= 12;
    194  1.1  cgd 		    ampm = 'p';
    195  1.1  cgd 		}
    196  1.1  cgd 		else if (t->tm_hour == 0)
    197  1.1  cgd 		    t->tm_hour = 12;
    198  1.1  cgd 		xprintf("%2d:%02d%cm\t", t->tm_hour, t->tm_min, ampm);
    199  1.1  cgd 	    }
    200  1.1  cgd 	    else {
    201  1.1  cgd 		xprintf("%2d:%02d\t", t->tm_hour, t->tm_min);
    202  1.1  cgd 	    }
    203  1.1  cgd 	}
    204  1.1  cgd     }
    205  1.1  cgd     prlex(&hp->Hlex);
    206  1.1  cgd }
    207