Lines Matching defs:bits
227 int i, bits;
232 bits = bits_to_store(max);
234 for (i = 0; i < bits-1; i++)
237 if ( (value | (1 << (bits-1))) <= max)
238 put_bits(pb, 1, value & (1 << (bits-1)));
243 int i, bits, value = 0;
248 bits = bits_to_store(max);
250 for (i = 0; i < bits-1; i++)
254 if ( (value | (1<<(bits-1))) <= max)
256 value += 1 << (bits-1);
265 int *copy, *bits;
293 bits = av_calloc(entries*max, sizeof(*bits));
294 if (!bits)
304 bits[x++] = copy[j] > i;
316 if (bits[i+pos] != dominant)
330 while (((pos + interloper) < x) && (bits[pos + interloper] == dominant))
352 av_free(bits);
363 int *bits = av_calloc(entries, sizeof(*bits));
365 if (!bits)
377 // av_log(NULL, AV_LOG_INFO, "entries: %d, low bits: %d\n", entries, low_bits);
386 bits[x++] = dominant;
400 bits[x++] = dominant;
402 bits[x++] = !dominant;
437 if (bits[i])
444 av_free(bits);