Lines Matching refs:count
100 short *count; /* number of symbols of each length */ member
130 int count; /* number of codes of length len */ in decode() local
140 next = h->count + 1; in decode()
145 count = *next++; in decode()
146 if (code < first + count) { /* if length len, return symbol */ in decode()
151 index += count; /* else update for next length */ in decode()
152 first += count; in decode()
209 h->count[len] = 0; in construct()
211 (h->count[length[symbol]])++; /* assumes lengths are within bounds */ in construct()
212 if (h->count[0] == n) /* no codes! */ in construct()
219 left -= h->count[len]; /* deduct count from possible codes */ in construct()
226 offs[len + 1] = offs[len] + h->count[len]; in construct()