Lines Matching defs:size
114 a = 256 - m->size;
115 for (int b = 0; b < m->size; b++) {
125 if (m->size == max)
128 for (int c = m->size - 1; c >= index; c--) {
135 m->size++;
160 for (q = 0, g = 0, e = 0; q < m->size; q++) {
255 a = 256 - m->size << (m->fshift > 0 ? m->fshift - 1 : 0);
271 for (a = 0, b = m->size; a < b; a++)
283 a = 256 - m->size << (0 < m->fshift ? m->fshift - 1 : 0);
284 for (b = 0, c = m->size; b < c; b++) {
303 for (c = m->size, d = 256 - c, e = 0; e < c; e++)
341 n.size = c + 1;
349 for (c = 0, e = n.size - 1; c < e; c++) {
350 for (g = c + 1, f = n.size; g < f; g++) {
380 int size;
382 if (m->size >= 40 || m->size >= m->length)
385 size = m->size;
386 m->symbols[size] = sym;
387 m->freqs[2 * size] = f1;
388 m->freqs[2 * size + 1] = f2;
389 m->cnts[size] = f1 - (f1 >> 1);
390 m->size++;
392 return size;
425 for (c = 0, d = 0, e = 0, f = 0, g = 0, q = m->size; g < q; g++) {
488 n.size = m->size + 1;
489 b = m->size;
502 int size, i;
504 size = m->size;
506 n.size = size;
507 for (i = 0; i < n.size; i++) {
510 AV_QSORT(n.symbols, size, uint8_t, cmpbytes);
511 for (i = 0; i < n.size; i++) {
527 int i, size, freqs;
531 size = m->size;
532 a = 256 - size;
533 for (i = 0; i < size; i++, a += freqs)
543 uint32_t size;
545 size = m->size;
546 for (int i = 0; i < size; i++) {
548 if (size <= 4)
555 if (size >= 14)
558 m->symbols[size] = val;
559 m->size++;
573 c = m->size;
601 n.size = c;
625 uint32_t size;
628 n.size = m->size + 1;
630 size = m->size;
631 for (int i = 0; i < size; i++)
633 n.symbols[size] = val;
642 uint32_t size;
644 size = m->size;
645 for (int i = 0; i < size; i++) {
649 if (m->size <= 32)
657 if (size >= 64)
660 m->symbols[size] = val;
661 m->size++;
679 for (c = m->size, d = (4096 - (256 - c)) / (c + 1) | 0, e = d - (d >> 1), g = 0; g < c;) {
708 uint32_t size = m->size;
710 for (int i = 0; i < size; i++) {
715 if (size >= 256)
718 m->symbols[size] = val;
719 m->size++;
787 a = 256 - m->size;
788 for (int b = 0; b < m->size; b++)
800 for (c = 0, e = 0; c < m->size && m->symbols[c] < value; c++) {
808 for (; c < m->size; g++, c++) {
812 n.size = m->size + 1;
837 m->size = 1;
859 param = m->freqs[0] + m->freqs[1] + m->freqs[2] + m->freqs[3] + 256 - m->size;