Lines Matching defs:count
130 static int count[256], nc, bmin;
153 if (++count[c] == 1 && c != endch) {
170 if (nc == 1 && count[bmin] == n) {
172 nc = count[bmin] = 0;
179 * count[] = counts of elements in bins.
180 * Before permuting: top[c-1] + count[c] = top[c];
186 top[0] = ak = a + count[0];
191 for (cp = count + bmin; nc > 0; cp++) {
201 top[cp-count] = ak += *cp;
215 * aj<-aj + count[c] connects the bins in a linked list;
216 * reset count[c].
218 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
229 static int count[256], nc, bmin;
249 if (++count[c] == 1 && c != endch) {
264 top[0] = ak = a + count[0];
265 count[0] = 0;
269 count[255] = 0;
271 for (cp = count + bmin; nc > 0; cp++) {
281 top[cp-count] = ak += c;
282 *cp = 0; /* Reset count[]. */