Lines Matching refs:next
36 struct _vchtree_s* next; /* link for the sorted lists */
83 f->next = f->link = NIL(Vchtree_t*);
112 for(f = sort[k = 0]; f != NIL(Vchtree_t*); f = f->next)
114 f->next = (k += 1) < notz ? sort[k] : NIL(Vchtree_t*);
121 ** 1. list and list->next are not NULL;
122 ** 2. head == NULL or head->freq >= list->next->freq
123 ** 3. tail == NULL or list->freq+list->next->freq >= tail->freq.
124 ** Then, list and list->next can be merged into a subtree.
126 f = list; s = list->next; list = s->next;
130 s->next = f; /* final_depth(s) = final_depth(f) + above difference */
140 tail = head ? (tail->next = f) : (head = f);
141 tail->next = NIL(Vchtree_t*);
144 { if(list->next && list->next->freq <= head->freq)
148 for(p = NIL(Vchtree_t*), f = head; f; p = f, f = f->next)
158 { p->next = list;
162 { f = head->next;
163 head->next = list->next;
164 list->next = head;
170 { if((list = head)->next == NIL(Vchtree_t*) )
183 { if((size[s-tree] += size[s->next-tree]) > c)