Lines Matching defs:head
71 Vchtree_t *f, *s, *p, *list, *tail, *head;
118 for(head = tail = NIL(Vchtree_t*), list = sort[0];; )
120 ** 0. The lists "list" and "head" are sorted by frequency.
122 ** 2. head == NULL or head->freq >= list->next->freq
140 tail = head ? (tail->next = f) : (head = f);
144 { if(list->next && list->next->freq <= head->freq)
147 /* find the segment in "head" movable to start of list */
148 for(p = NIL(Vchtree_t*), f = head; f; p = f, f = f->next)
154 ** Now observe that tail->freq <= 2*head->freq and
159 list = head;
162 { f = head->next;
163 head->next = list->next;
164 list->next = head;
166 if(!(head = f) )
170 { if((list = head)->next == NIL(Vchtree_t*) )
172 head = tail = NIL(Vchtree_t*);