Home
last modified time | relevance | path

Searched refs:Freq (Results 1 – 12 of 12) sorted by relevance

/freebsd-9-stable/contrib/llvm/lib/Support/
DBlockFrequency.cpp114 BlockFrequency Freq(Frequency); in operator *() local
115 Freq *= Prob; in operator *()
116 return Freq; in operator *()
125 BlockFrequency Freq(Frequency); in operator /() local
126 Freq /= Prob; in operator /()
127 return Freq; in operator /()
130 BlockFrequency &BlockFrequency::operator+=(const BlockFrequency &Freq) { in operator +=() argument
131 uint64_t Before = Freq.Frequency; in operator +=()
132 Frequency += Freq.Frequency; in operator +=()
143 BlockFrequency Freq(Frequency); in operator +() local
[all …]
/freebsd-9-stable/lib/libz/
Dtrees.c415 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]))
524 f = tree[n].Freq;
559 *(long)tree[m].Freq;
635 if (tree[n].Freq != 0) {
650 tree[node].Freq = 1;
[all …]
Ddeflate.h76 #define Freq fc.freq macro
327 s->dyn_ltree[cc].Freq++; \
336 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
337 s->dyn_dtree[d_code(dist)].Freq++; \
/freebsd-9-stable/contrib/llvm/include/llvm/Support/
DBlockFrequency.h36 BlockFrequency(uint64_t Freq = 0) : Frequency(Freq) { } in Frequency() argument
59 BlockFrequency &operator+=(const BlockFrequency &Freq);
60 const BlockFrequency operator+(const BlockFrequency &Freq) const;
85 raw_ostream &operator<<(raw_ostream &OS, const BlockFrequency &Freq);
/freebsd-9-stable/contrib/llvm/lib/CodeGen/
DSpillPlacement.cpp234 BlockFrequency Freq = BlockFrequencies[I->Number]; in addConstraints() local
240 nodes[ib].addBias(Freq, I->Entry); in addConstraints()
247 nodes[ob].addBias(Freq, I->Exit); in addConstraints()
256 BlockFrequency Freq = BlockFrequencies[*I]; in addPrefSpill() local
258 Freq += Freq; in addPrefSpill()
263 nodes[ib].addBias(Freq, PrefSpill); in addPrefSpill()
264 nodes[ob].addBias(Freq, PrefSpill); in addPrefSpill()
284 BlockFrequency Freq = BlockFrequencies[Number]; in addLinks() local
285 nodes[ib].addLink(ob, Freq); in addLinks()
286 nodes[ob].addLink(ib, Freq); in addLinks()
DMachineBlockPlacement.cpp1071 BlockFrequency Freq = MBFI->getBlockFreq(*BI); in buildCFGChains() local
1072 if (Freq < WeightedEntryFreq) in buildCFGChains()
1079 if (Freq < (LoopHeaderFreq * ColdProb)) in buildCFGChains()
1099 if (LayoutEdgeFreq <= (Freq * ColdProb)) in buildCFGChains()
DStackSlotColoring.cpp145 BlockFrequency Freq = MBFI->getBlockFreq(MBB); in ScanForSpillSlotRefs() local
160 li.weight += LiveIntervals::getSpillWeight(false, true, Freq); in ScanForSpillSlotRefs()
/freebsd-9-stable/sys/cddl/contrib/opensolaris/uts/common/zmod/
Dtrees.c417 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]))
526 f = tree[n].Freq;
561 *(long)tree[m].Freq;
637 if (tree[n].Freq != 0) {
652 tree[node].Freq = 1;
[all …]
Ddeflate.h73 #define Freq fc.freq macro
312 s->dyn_ltree[cc].Freq++; \
321 s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
322 s->dyn_dtree[d_code(dist)].Freq++; \
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DBlockFrequencyImpl.h68 void setBlockFreq(BlockT *BB, BlockFrequency Freq) { in setBlockFreq() argument
69 Freqs[BB] = Freq; in setBlockFreq()
70 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") = " << Freq << "\n"); in setBlockFreq()
82 void incBlockFreq(BlockT *BB, BlockFrequency Freq) { in incBlockFreq() argument
83 Freqs[BB] += Freq; in incBlockFreq()
84 DEBUG(dbgs() << "Frequency(" << getBlockName(BB) << ") += " << Freq in incBlockFreq()
/freebsd-9-stable/sys/net/
Dzlib.c324 #define Freq fc.freq macro
2175 for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
2176 for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
2177 for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
2179 s->dyn_ltree[END_BLOCK].Freq = 1;
2204 (tree[n].Freq < tree[m].Freq || \
2205 (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
2284 f = tree[n].Freq;
2319 *(long)tree[m].Freq;
2395 if (tree[n].Freq != 0) {
[all …]
/freebsd-9-stable/contrib/llvm/tools/llvm-bcanalyzer/
Dllvm-bcanalyzer.cpp592 if (unsigned Freq = Stats.CodeFreq[i].NumInstances) in AnalyzeBitcode() local
593 FreqPairs.push_back(std::make_pair(Freq, i)); in AnalyzeBitcode()