Lines Matching full:freq
310 s->Freq = 1;
378 upState.Freq = ONE_STATE(c)->Freq;
384 cf = s->Freq - 1;
386 upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0))));
427 if (p->FoundState->Freq < MAX_FREQ / 4 && p->MinContext->Suffix != 0)
434 if (s->Freq < 32)
435 s->Freq++;
443 if (s[0].Freq >= s[-1].Freq)
449 if (s->Freq < MAX_FREQ - 9)
451 s->Freq += 2;
501 s0 = p->MinContext->SummFreq - (ns = p->MinContext->NumStats) - (p->FoundState->Freq - 1);
541 if (s->Freq < MAX_FREQ / 4 - 1)
542 s->Freq <<= 1;
544 s->Freq = MAX_FREQ - 4;
545 c->SummFreq = (UInt16)(s->Freq + p->InitEsc + (ns > 3));
547 cf = 2 * (UInt32)p->FoundState->Freq * (c->SummFreq + 6);
563 s->Freq = (Byte)cf;
581 escFreq = p->MinContext->SummFreq - s->Freq;
582 s->Freq += 4;
584 s->Freq = (Byte)((s->Freq + adder) >> 1);
585 sumFreq = s->Freq;
590 escFreq -= (++s)->Freq;
591 s->Freq = (Byte)((s->Freq + adder) >> 1);
592 sumFreq += s->Freq;
593 if (s[0].Freq > s[-1].Freq)
599 while (--s1 != stats && tmp.Freq > s1[-1].Freq);
605 if (s->Freq == 0)
609 do { i++; } while ((--s)->Freq == 0);
617 tmp.Freq = (Byte)(tmp.Freq - (tmp.Freq >> 1));
671 s->Freq += 4;
673 if (s[0].Freq > s[-1].Freq)
677 if (s->Freq > MAX_FREQ)
685 p->PrevSuccess = (2 * p->FoundState->Freq > p->MinContext->SummFreq);
688 if ((p->FoundState->Freq += 4) > MAX_FREQ)
695 p->FoundState->Freq = (Byte)(p->FoundState->Freq + (p->FoundState->Freq < 128 ? 1: 0));
704 if ((p->FoundState->Freq += 4) > MAX_FREQ)