| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| armVCM4P10_PredictIntraDC4x4.c | 66 int x, y, Sum=0, Count = 0;
72 Sum += pSrcLeft[y*leftStep];
80 Sum += pSrcAbove[x];
86 Sum = 128;
90 Sum = (Sum + 2) >> 2;
94 Sum = (Sum + 4) >> 3;
100 pDst[y*dstStep+x] = (OMX_U8)Sum;
|
| omxVCM4P10_PredictIntraChroma_8x8.c | 66 int x, y, Sum=0, Count = 0;
72 Sum += pSrcAbove[x];
80 Sum += pSrcLeft[y*leftStep];
86 Sum = 128;
90 Sum = (Sum + 2) >> 2;
96 pDst[y*dstStep+x] = (OMX_U8)Sum;
128 int x, y, Sum=0, Count = 0;
134 Sum += pSrcLeft[y*leftStep];
142 Sum += pSrcAbove[x]
[all...] |
| omxVCM4P10_PredictIntra_16x16.c | 104 int x,y,Sum,Count;
147 Sum = 0;
153 Sum += pSrcLeft[y*leftStep];
161 Sum += pSrcAbove[x];
167 Sum = 128;
171 Sum = (Sum + 8) >> 4;
175 Sum = (Sum + 16) >> 5;
181 pDst[y*dstStep+x] = (OMX_U8)Sum;
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 33 // First we compute the sum with 64-bits of precision, ensuring that cannot
37 uint64_t Sum = 0;
42 Sum += Weight;
45 // If the computed sum fits in 32-bits, we're done.
46 if (Sum <= UINT32_MAX)
47 return Sum;
50 // re-sum with that scale applied.
51 assert((Sum / UINT32_MAX) < UINT32_MAX);
52 Scale = (Sum / UINT32_MAX) + 1;
53 Sum = 0
[all...] |
| /external/llvm/lib/Support/ |
| IntervalMap.cpp | 132 unsigned Sum = 0;
134 Sum += NewSize[n] = PerNode + (n < Extra);
135 if (PosPair.first == Nodes && Sum > Position)
136 PosPair = IdxPair(n, Position - (Sum - NewSize[n]));
138 assert(Sum == Elements + Grow && "Bad distribution sum");
148 Sum = 0;
151 Sum += NewSize[n];
153 assert(Sum == Elements && "Bad distribution sum");
[all...] |
| /external/llvm/unittests/ADT/ |
| VariadicFunctionTest.cpp | 38 // Defines a variadic function Sum(), whose arguments and return value
48 const VariadicFunction<long, int, SumImpl> Sum = {};
51 EXPECT_EQ(0, Sum());
52 EXPECT_EQ(1, Sum(1));
53 EXPECT_EQ(12, Sum(10, 2));
54 EXPECT_EQ(1234567, Sum(1000000, 200000, 30000, 4000, 500, 60, 7));
|
| /external/opencv/cv/src/ |
| cvcondens.cpp | 162 float Sum = 0;
179 Sum += ConDens->flConfidence[i];
180 ConDens->flCumulative[i] = Sum;
185 icvScaleVector_32f( ConDens->Temp, ConDens->Temp, ConDens->DP, 1.f / Sum );
188 Sum = Sum / ConDens->SamplesNum;
194 while( (ConDens->flCumulative[j] <= (float) i * Sum)&&(j<ConDens->SamplesNum-1))
|
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 81 Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
85 ReturnInst::Create(Context, Sum, RecurseBB);
|
| /art/runtime/base/ |
| histogram.h | 51 // cumulative_freq[i] = sum(frequency[j] : 0 < j < i )
53 // cumulative_perc[i] = sum(frequency[j] / SampleSize : 0 < j < i )
71 Value Sum() const {
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/summary/ |
| Sum.java | 25 * Returns the sum of the available values.
37 public class Sum extends AbstractStorelessUnivariateStatistic implements Serializable {
46 * The currently running sum.
51 * Create a Sum instance
53 public Sum() {
59 * Copy constructor, creates a new {@code Sum} identical
62 * @param original the {@code Sum} instance to copy
64 public Sum(Sum original) {
106 * The sum of the entries in the specified portion o
121 double sum = Double.NaN; local
160 double sum = Double.NaN; local
[all...] |
| /external/llvm/lib/Analysis/ |
| AliasAnalysisCounter.cpp | 43 void printLine(const char *Desc, unsigned Val, unsigned Sum) {
45 << Val*100/Sum << "%)\n";
|
| BranchProbabilityInfo.cpp | 549 uint32_t Sum = 0;
553 uint32_t PrevSum = Sum;
555 Sum += Weight;
556 assert(Sum > PrevSum); (void) PrevSum;
559 return Sum;
570 uint32_t Sum = 0;
577 uint32_t PrevSum = Sum;
579 Sum += Weight;
580 assert(Sum > PrevSum); (void) PrevSum;
589 if (BranchProbability(MaxWeight, Sum) > BranchProbability(4, 5)
[all...] |
| /external/giflib/ |
| quantize.c | 203 long Sum, Count;
248 Sum = NewColorSubdiv[Index].Count / 2 - QuantizedColor->Count;
252 (Sum -= QuantizedColor->Pnext->Count) >= 0 &&
|
| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 146 SmallVector<const SCEV *, 16> Sum;
147 Sum.push_back(SE.getMulExpr(A[0], B[0]));
148 EXPECT_EQ(Product->getOperand(0), SE.getAddExpr(Sum));
149 Sum.clear();
154 Sum.push_back(SE.getMulExpr(A[1], B[0]));
155 Sum.push_back(SE.getMulExpr(A[0], B[1]));
156 Sum.push_back(SE.getMulExpr(A[1], B[1]));
157 EXPECT_EQ(Product->getOperand(1), SE.getAddExpr(Sum));
158 Sum.clear();
160 Sum.push_back(SE.getMulExpr(A[2], B[0]))
[all...] |
| /external/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 106 Value *Sum =
110 ReturnInst::Create(M->getContext(), Sum, RecurseBB);
|
| /external/llvm/lib/Target/R600/ |
| SIInsertWaits.cpp | 247 // Get the hardware counter increments and sum them up
249 unsigned Sum = 0;
253 Sum += Increment.Array[i];
257 if (Sum == 0) {
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmsgmt.c | 432 cmsFloat32Number Sum;
439 for (Sum=0, i=0; i < bp ->nOutputChans; i++)
440 Sum += RoundTrip[i];
443 if (Sum > bp ->MaxTAC) {
445 bp ->MaxTAC = Sum;
|
| /external/v8/test/cctest/ |
| test-compiler.cc | 129 static double Sum(Isolate* isolate, int n) {
141 TEST(Sum) {
144 CHECK_EQ(5050.0, Sum(CcTest::i_isolate(), 100));
181 "function Cons2(x, y) { this.sum = x + y; }\n"
182 "if (new Cons2(3,4).sum == 7) r+=256;"; // 256
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/ |
| SummaryStatistics.java | 29 import org.apache.commons.math.stat.descriptive.summary.Sum;
70 /** sum of values that have been added */
71 protected Sum sum = new Sum(); field in class:SummaryStatistics
73 /** sum of the square of each value that has been added */
94 /** Sum statistic implementation - can be reset by setter. */
95 private StorelessUnivariateStatistic sumImpl = sum;
97 /** Sum of squares statistic implementation - can be reset by setter. */
106 /** Sum of log statistic implementation - can be reset by setter. *
[all...] |
| /external/openfst/src/include/fst/ |
| accumulator.h | 56 Weight Sum(Weight w, Weight v) {
61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
63 Weight sum = w; local
66 sum = Plus(sum, aiter->Value().weight);
67 return sum;
95 Weight Sum(Weight w, Weight v) {
100 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
102 Weight sum = w; local
105 sum = LogPlus(sum, aiter->Value().weight)
261 double sum = FloatLimits<double>::PosInfinity(); local
501 Weight sum = w; local
[all...] |
| /external/clang/test/SemaCXX/ |
| constant-expression-cxx11.cpp | 130 constexpr int Sum(int a = 0, const int &b = 0, const int *c = &z, char d = 0) {
136 static_assert(Sum() == 0, "");
137 static_assert(Sum(1) == 1, "");
138 static_assert(Sum(1, four) == 5, "");
139 static_assert(Sum(1, eight, &twentyseven) == 36, "");
140 static_assert(Sum(1, 2, &four, eight) == 15, "");
482 constexpr auto Sum(Iter begin, Iter end) -> decltype(+*begin) {
483 return begin == end ? 0 : *begin + Sum(begin+1, end);
488 constexpr int sum_xs = Sum(begin(xs), end(xs));
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-open-type-private.hh | 697 uint32_t Sum = 0L;
701 Sum += *Table++;
702 return Sum;
|
| /external/libvpx/libvpx/vp8/encoder/ |
| bitstream.c | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 88 uint64_t Sum = Mass + X.Mass;
89 Mass = Sum < Mass ? UINT64_MAX : Sum;
340 uint64_t Total; ///< Sum of all weights.
692 /// - Normalize the distribution: scale weights down so that their sum
756 /// used for computing loop scale) is the sum of all iterations.
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| bitstream.c | [all...] |
