Searched refs:Hnext (Results 1 – 5 of 5) sorted by relevance
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()[all …]
464 struct Hist *h = Histlist.Hnext; in c_expand()535 for (; h; h = h->Hnext) { in c_expand()541 for (i = (int) (q - p); h; h = h->Hnext) { in c_expand()983 hp = Histlist.Hnext; in GetHistLine()988 if ((hp->Hnext) == NULL) { in GetHistLine()992 hp = hp->Hnext; in GetHistLine()1715 hp = Histlist.Hnext; in e_toggle_hist()1721 hp = hp->Hnext; in e_toggle_hist()1868 hp = Histlist.Hnext; in e_up_search_hist()1875 hp = hp->Hnext; in e_up_search_hist()[all …]
1281 for (hp = Histlist.Hnext; hp; hp = hp->Hnext) in gethent()1298 for (hp = Histlist.Hnext; hp; hp = hp->Hnext) { in findev()
1076 struct Hist *Hnext, *Hprev; /* doubly linked list */ member
472 @ >>+ denotes Hnext += Hn>>26, Hn &= 0x3ffffff. This means that