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

  /external/llvm/unittests/Support/
BlockFrequencyTest.cpp 12 BlockFrequency Freq(1);
14 Freq *= Prob;
15 EXPECT_EQ(Freq.getFrequency(), 0u);
19 BlockFrequency Freq(1);
21 Freq *= Prob;
22 EXPECT_EQ(Freq.getFrequency(), 1u);
26 BlockFrequency Freq(3);
28 Freq *= Prob;
29 EXPECT_EQ(Freq.getFrequency(), 1u);
33 BlockFrequency Freq(UINT64_MAX)
    [all...]
  /external/llvm/lib/Support/
BlockFrequency.cpp 21 /// Multiply FREQ by N and store result in W array.
22 static void mult96bit(uint64_t freq, uint32_t N, uint64_t W[2]) {
23 uint64_t u0 = freq & UINT32_MAX;
24 uint64_t u1 = freq >> 32;
96 BlockFrequency Freq(Frequency);
97 Freq *= Prob;
98 return Freq;
107 BlockFrequency Freq(Frequency);
108 Freq /= Prob;
109 return Freq;
    [all...]
  /external/llvm/include/llvm/Support/
BlockFrequency.h 34 BlockFrequency(uint64_t Freq = 0) : Frequency(Freq) { }
57 BlockFrequency &operator+=(const BlockFrequency &Freq);
58 const BlockFrequency operator+(const BlockFrequency &Freq) const;
79 raw_ostream &operator<<(raw_ostream &OS, const BlockFrequency &Freq);
  /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 133 void addBias(BlockFrequency freq, BorderConstraint direction) {
138 BiasP += freq;
141 BiasN += freq;
234 BlockFrequency Freq = BlockFrequencies[I->Number];
240 nodes[ib].addBias(Freq, I->Entry);
247 nodes[ob].addBias(Freq, I->Exit);
256 BlockFrequency Freq = BlockFrequencies[*I];
258 Freq += Freq;
263 nodes[ib].addBias(Freq, PrefSpill)
    [all...]
StackSlotColoring.cpp 145 BlockFrequency Freq = MBFI->getBlockFreq(MBB);
160 li.weight += LiveIntervals::getSpillWeight(false, true, Freq);
MachineBlockPlacement.cpp 457 << " (freq)\n");
579 << MBFI->getBlockFreq(Pred) << " freq\n");
    [all...]
  /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::__anon30822
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.3/
trees.c 417 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
418 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
419 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
421 s->dyn_ltree[END_BLOCK].Freq = 1;
446 (tree[n].Freq < tree[m].Freq || \
447 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
483 * IN assertion: the fields freq and dad are set, heap[heap_max] and
526 f = tree[n].Freq;
    [all...]
deflate.h 64 ush freq; /* frequency count */ member in union:ct_data_s::__anon26977
73 #define Freq fc.freq
312 s->dyn_ltree[cc].Freq++; \
321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
322 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::__anon16436
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/include/llvm/Analysis/
BlockFrequencyImpl.h 68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) {
69 Freqs[BB] = Freq;
70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n");
80 /// incBlockFreq - Increase BB block frequency by FREQ.
82 void incBlockFreq(BlockT *BB, BlockFrequency Freq) {
83 Freqs[BB] += Freq;
84 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") += " << Freq
228 // The cyclic probability is freq(BackEdges) / freq(Head), where freq(Head
    [all...]
  /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));
  /prebuilts/misc/common/tradefed/
tradefed-prebuilt.jar 

Completed in 420 milliseconds