Searched defs:population (Results 1 - 7 of 7) sorted by relevance

/external/chromium_org/third_party/libwebp/dsp/
H A Dlossless_mips32.c101 // const uint32_t* pop = &population[4];
102 // const uint32_t* LoopEnd = &population[length];
110 static double ExtraCost(const uint32_t* const population, int length) { argument
112 const uint32_t* pop = &population[4];
113 const uint32_t* const LoopEnd = &population[length];
220 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument
230 if (population[i] == population[i + 1]) {
233 temp0 = (population[i] != 0);
238 temp0 = (population[
[all...]
H A Dlossless.c1463 static double ExtraCost(const uint32_t* population, int length) { argument
1466 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2];
1482 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument
1489 if (population[i] == population[i + 1]) {
1492 stats.counts[population[i] != 0] += (streak > 3);
1493 stats.streaks[population[i] != 0][(streak > 3)] += streak;
1497 stats.counts[population[i] != 0] += (streak > 3);
1498 stats.streaks[population[i] != 0][(streak > 3)] += streak;
/external/webp/src/dsp/
H A Dlossless_mips32.c101 // const uint32_t* pop = &population[4];
102 // const uint32_t* LoopEnd = &population[length];
110 static double ExtraCost(const uint32_t* const population, int length) { argument
112 const uint32_t* pop = &population[4];
113 const uint32_t* const LoopEnd = &population[length];
220 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument
230 if (population[i] == population[i + 1]) {
233 temp0 = (population[i] != 0);
238 temp0 = (population[
[all...]
H A Dlossless.c1454 static double ExtraCost(const uint32_t* population, int length) { argument
1457 for (i = 2; i < length - 2; ++i) cost += (i >> 1) * population[i + 2];
1473 static VP8LStreaks HuffmanCostCount(const uint32_t* population, int length) { argument
1480 if (population[i] == population[i + 1]) {
1483 stats.counts[population[i] != 0] += (streak > 3);
1484 stats.streaks[population[i] != 0][(streak > 3)] += streak;
1488 stats.counts[population[i] != 0] += (streak > 3);
1489 stats.streaks[population[i] != 0][(streak > 3)] += streak;
/external/chromium_org/chrome/app/
H A Dclient_util.cc75 // being in an experiment population and experimental group thereof.
76 void GetPreReadPopulationAndGroup(double* population, double* group) { argument
90 // the experiment population and the second 8 bytes as a die-toss for being
101 *population = base::BitsToOpenEndedUnitInterval(random_bits[0]);
119 double population = 0.0; local
121 GetPreReadPopulationAndGroup(&population, &group);
130 // those not in the experiment population also use the default pre-read level.
133 if (PreReadExperimentIsActive() && (population <= threshold)) {
134 // We divide the experiment population into groups pre-reading at 5 percent
/external/chromium_org/third_party/libwebp/enc/
H A Dhistogram.c243 static double HuffmanCost(const uint32_t* const population, int length) { argument
244 const VP8LStreaks stats = VP8LHuffmanCostCount(population, length);
255 static double PopulationCost(const uint32_t* const population, int length) { argument
256 return BitsEntropy(population, length) + HuffmanCost(population, length);
/external/webp/src/enc/
H A Dhistogram.c243 static double HuffmanCost(const uint32_t* const population, int length) { argument
244 const VP8LStreaks stats = VP8LHuffmanCostCount(population, length);
255 static double PopulationCost(const uint32_t* const population, int length) { argument
256 return BitsEntropy(population, length) + HuffmanCost(population, length);

Completed in 309 milliseconds