79     struct Hist *fp = pp->Hnext;        /* following element, if any */  in hinsert()
80     hp->Hnext = fp, hp->Hprev = pp;  in hinsert()
81     pp->Hnext = hp;  in hinsert()
95     pp->Hnext = hp->Hnext;  in hremove()
96     if (hp->Hnext)  in hremove()
97         hp->Hnext->Hprev = pp;  in hremove()
118     while (histCount > (unsigned)hlen && (np = Histlist.Hnext)) {  in discardExcess()
133 	(np = hp->Hnext) != NULL;)  in discardExcess()
621     while ((p = p->Hnext))  in renumberHist()
754         for (hp = &Histlist; (hp = hp->Hnext) != NULL;) {  in createHistHashTable()
890     if (histMerg && histMerg != &Histlist && histMerg != Histlist.Hnext) {  in mergeInsertionPoint()
907     while ((p = pp->Hnext) && (p->Htime > np->Htime))  in mergeInsertionPoint()
918     for (p = Histlist.Hnext; p != pp->Hnext; p = p->Hnext) {  in bubbleHnumHrefDown()
970 	    if (pp->Hnext && heq(lp, &(pp->Hnext->Hlex))) {  in enthist()
971 		p = pp->Hnext;  in enthist()
1013         for (p = pp->Hnext; p && p->Htime == np->Htime; pp = p, p = p->Hnext) {  in enthist()
1112 	    for (hp = Histlist.Hnext;  in dophist()
1113 		 --n > 0 && hp->Hnext != NULL;  in dophist()
1114 		 hp = hp->Hnext)  in dophist()
1122 	for (hp = Histlist.Hnext; n-- > 0 && hp != NULL; hp = hp->Hnext)  in dophist()
1169         for (hp = &Histlist; (np = hp->Hnext) != NULL;)  in dohist()
1375         while ((hp = hp->Hnext))  in loadhist()