HomeSort by relevance Sort by last modified time
    Searched refs:Freq (Results 1 - 25 of 27) sorted by null

1 2

  /external/llvm/unittests/Support/
BlockFrequencyTest.cpp 12 BlockFrequency Freq(1);
14 Freq *= Prob;
15 EXPECT_EQ(Freq.getFrequency(), 0u);
17 Freq = BlockFrequency(1);
18 Freq *= Prob;
19 EXPECT_EQ(Freq.getFrequency(), 0u);
23 BlockFrequency Freq(1);
25 Freq *= Prob;
26 EXPECT_EQ(Freq.getFrequency(), 1u);
28 Freq = BlockFrequency(1)
    [all...]
  /external/llvm/lib/Support/
BlockFrequency.cpp 28 BlockFrequency Freq(Frequency);
29 Freq *= Prob;
30 return Freq;
39 BlockFrequency Freq(Frequency);
40 Freq /= Prob;
41 return Freq;
44 BlockFrequency &BlockFrequency::operator+=(const BlockFrequency &Freq) {
45 uint64_t Before = Freq.Frequency;
46 Frequency += Freq.Frequency;
57 BlockFrequency Freq(Frequency)
    [all...]
  /external/llvm/include/llvm/Support/
BlockFrequency.h 29 BlockFrequency(uint64_t Freq = 0) : Frequency(Freq) { }
49 BlockFrequency &operator+=(const BlockFrequency &Freq);
50 const BlockFrequency operator+(const BlockFrequency &Freq) const;
  /external/lzma/C/
Ppmd7.c 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)
    [all...]
Ppmd7Dec.c 87 if ((count = rc->GetThreshold(rc, p->MinContext->SummFreq)) < (hiCnt = s->Freq))
90 rc->Decode(rc, 0, s->Freq);
100 if ((hiCnt += (++s)->Freq) > count)
103 rc->Decode(rc, hiCnt - s->Freq, s->Freq);
158 hiCnt += (s->Freq & k);
172 for (hiCnt = 0; (hiCnt += (*pps)->Freq) <= count; pps++);
174 rc->Decode(rc, hiCnt - s->Freq, s->Freq);
Ppmd7Enc.c 87 RangeEnc_Encode(rc, 0, s->Freq, p->MinContext->SummFreq);
93 sum = s->Freq;
99 RangeEnc_Encode(rc, sum, s->Freq, p->MinContext->SummFreq);
104 sum += s->Freq;
166 sum += (s->Freq & (int)(MASK(s->Symbol)));
170 RangeEnc_Encode(rc, low, s1->Freq, sum + escFreq);
176 sum += (s->Freq & (int)(MASK(cur)));
Ppmd.h 35 UInt16 Summ; /* Freq */
36 Byte Shift; /* Speed of Freq change; low Shift is for fast change */
46 Byte Freq;
Ppmd7.h 89 &p->BinSumm[Ppmd7Context_OneState(p->MinContext)->Freq - 1][p->PrevSuccess + \
  /external/llvm/lib/CodeGen/
SpillPlacement.cpp 79 uint64_t Freq = Entry.getFrequency();
80 uint64_t Scaled = (Freq >> 13) + bool(Freq & (1 << 12));
151 void addBias(BlockFrequency freq, BorderConstraint direction) {
156 BiasP += freq;
159 BiasN += freq;
253 BlockFrequency Freq = BlockFrequencies[I->Number];
259 nodes[ib].addBias(Freq, I->Entry);
266 nodes[ob].addBias(Freq, I->Exit);
275 BlockFrequency Freq = BlockFrequencies[*I]
    [all...]
MachineBlockFrequencyInfo.cpp 27 #define DEBUG_TYPE "block-freq"
37 ViewMachineBlockFreqPropagationDAG("view-machine-block-freq-propagation-dags",
116 INITIALIZE_PASS_BEGIN(MachineBlockFrequencyInfo, "machine-block-freq",
120 INITIALIZE_PASS_END(MachineBlockFrequencyInfo, "machine-block-freq",
181 const BlockFrequency Freq) const {
182 return MBFI ? MBFI->printBlockFreq(OS, Freq) : OS;
MachineBlockPlacement.cpp 451 MBFI->printBlockFreq(dbgs(), CandidateFreq) << " (freq)\n");
573 MBFI->printBlockFreq(dbgs(), Pred) << " freq\n");
    [all...]
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfo.h 54 // Print the block frequency Freq to OS using the current functions entry
55 // frequency to convert freq into a relative decimal form.
56 raw_ostream &printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const;
  /external/llvm/include/llvm/CodeGen/
MachineBlockFrequencyInfo.h 56 // Print the block frequency Freq to OS using the current functions entry
57 // frequency to convert freq into a relative decimal form.
58 raw_ostream &printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const;
  /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
fx_zlib_trees.c 415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
419 s->dyn_ltree[END_BLOCK].Freq = 1;
444 (tree[n].Freq < tree[m].Freq || \
445 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
481 * IN assertion: the fields freq and dad are set, heap[heap_max] and
524 f = tree[n].Freq;
    [all...]
deflate.h 67 ush freq; /* frequency count */ member in union:ct_data_s::__anon33194
76 #define Freq fc.freq
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
  /external/qemu/distrib/zlib-1.2.8/
trees.c 415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
419 s->dyn_ltree[END_BLOCK].Freq = 1;
444 (tree[n].Freq < tree[m].Freq || \
445 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
481 * IN assertion: the fields freq and dad are set, heap[heap_max] and
524 f = tree[n].Freq;
    [all...]
deflate.h 67 ush freq; /* frequency count */ member in union:ct_data_s::__anon34234
76 #define Freq fc.freq
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
  /external/zlib/src/
trees.c 415 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
416 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
417 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
419 s->dyn_ltree[END_BLOCK].Freq = 1;
444 (tree[n].Freq < tree[m].Freq || \
445 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
481 * IN assertion: the fields freq and dad are set, heap[heap_max] and
524 f = tree[n].Freq;
    [all...]
deflate.h 67 ush freq; /* frequency count */ member in union:ct_data_s::__anon38431
76 #define Freq fc.freq
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
  /external/chromium_org/third_party/zlib/
trees.c 421 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
422 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
423 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
425 s->dyn_ltree[END_BLOCK].Freq = 1;
450 (tree[n].Freq < tree[m].Freq || \
451 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
487 * IN assertion: the fields freq and dad are set, heap[heap_max] and
530 f = tree[n].Freq;
    [all...]
deflate.h 64 ush freq; /* frequency count */ member in union:ct_data_s::__anon21014
73 #define Freq fc.freq
328 s->dyn_ltree[cc].Freq++; \
337 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
338 s->dyn_dtree[d_code(dist)].Freq++; \
  /external/llvm/lib/Analysis/
BlockFrequencyInfo.cpp 27 #define DEBUG_TYPE "block-freq"
37 ViewBlockFreqPropagationDAG("view-block-freq-propagation-dags", cl::Hidden,
108 INITIALIZE_PASS_BEGIN(BlockFrequencyInfo, "block-freq",
112 INITIALIZE_PASS_END(BlockFrequencyInfo, "block-freq",
170 printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const {
171 return BFI ? BFI->printBlockFreq(OS, Freq) : OS;
BlockFrequencyInfoImpl.cpp 22 #define DEBUG_TYPE "block-freq"
536 const BlockFrequency &Freq) const {
537 Scaled64 Block(Freq.getFrequency(), 0);
  /frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/src/
LVPSA_Control.c 179 LVM_UINT16 Freq;
200 Freq = (LVM_UINT16) ((LVPSA_SampleRateTab[pInst->CurrentParams.Fs]>>1) / (pInst->nBands + 1));
203 pInst->pFiltersParams[ii-1].CenterFrequency = (LVM_UINT16) (Freq * ii);
    [all...]
  /external/llvm/tools/llvm-bcanalyzer/
llvm-bcanalyzer.cpp 589 std::vector<std::pair<unsigned, unsigned> > FreqPairs; // <freq,code>
591 if (unsigned Freq = Stats.CodeFreq[i].NumInstances)
592 FreqPairs.push_back(std::make_pair(Freq, i));

Completed in 2274 milliseconds

1 2