contrib/tcsh/sh.hist.c

72 static struct Hist *histMerg = NULL;	 /* last element merged by Htime */
882  * new entry, so that the Htime entries are decreasing.  Return the entry just
892     if (histTail && histTail->Htime >= np->Htime)
897 	if (histMerg->Htime >= np->Htime)
899 	else if (histMerg->Hprev->Htime >= np->Htime)
903         /* With hint, search up the list until Htime is greater.  We skip past
906         while (pp != &Histlist && pp->Htime <= np->Htime)
911     while ((p = pp->Hnext) && (p->Htime > np->Htime))
952 		if (Htime != 0 && p->Htime > Htime)
953 		    Htime = p->Htime;
956                 if (mflg && Htime != 0 && p->Hprev->Htime >= Htime)
970 	    if (p)   /* p!=NULL, only update this entry's Htime below */
983     /* Pick up timestamp set by lex() in Htime if reading saved history */
984     if (Htime != 0) {
985 	np->Htime = Htime;
986 	Htime = 0;
989         (void) time(&(np->Htime));
1013        If merging, advance insertion point, in pp, according to Htime. */
1014     /* XXX -- In histdup=all, Htime values can be non-monotonic. */
1015     if (mflg) {                         /* merge according to np->Htime */
1017         for (p = pp->Hnext; p && p->Htime == np->Htime; pp = p, p = p->Hnext) {
1074 	    xprintf("#+%010lu\n", (unsigned long)hp->Htime);
1090 	p = tprintf(FMT_HISTORY, cp, NULL, hp->Htime, hp);