| /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/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/v8/test/js-perf-test/SpreadCalls/ |
| spreadcalls.js | 6 new Benchmark('Call-Sum', false, false, 0,
12 new Benchmark('CallMethod-Sum', false, false, 0,
17 new Benchmark('CallNew-Sum', false, false, 0,
25 function sum() { function
40 result = sum(...objectToSpread);
50 var O = { sum: sum };
52 result = O.sum(...objectToSpread);
62 function Sum() {
67 return this.sum = result
[all...] |
| /external/xmlrpcpp/test/ |
| HelloServer.cpp | 44 // A variable number of arguments are passed, all doubles, result is their sum.
45 class Sum : public XmlRpcServerMethod
48 Sum(XmlRpcServer* s) : XmlRpcServerMethod("Sum", s) {}
53 double sum = 0.0; local
55 sum += double(params[i]);
56 result = sum;
58 } sum(&s);
|
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 82 Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
86 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 )
72 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/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
| reduce_to_vec.hpp | 65 template <typename T> struct Sum : plus<T>
71 typedef Sum<U> other;
|
| /external/giflib/ |
| quantize.c | 203 long Sum, Count;
259 Sum = NewColorSubdiv[Index].Count / 2 - QuantizedColor->Count;
263 (Sum -= QuantizedColor->Pnext->Count) >= 0 &&
|
| /external/google-benchmark/src/ |
| stat.h | 108 // Return the sum of this sample set
109 VType Sum() const { return sum_; }
144 NumType numsamples_; // sum of weight[i];
145 VType sum_; // sum of weight[i]*value[i];
146 VType sum_squares_; // sum of weight[i]*value[i]^2;
|
| /external/llvm/include/llvm/Support/ |
| BranchProbability.h | 60 // Normalize given probabilties so that the sum of them becomes approximate
66 // Normalize a list of weights by scaling them down so that the sum of them
187 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0),
197 // If the sum of all known probabilities is less than one, evenly distribute
198 // the complement of sum to unknown probabilities. Otherwise, set unknown
200 if (Sum < BranchProbability::getDenominator())
202 (BranchProbability::getDenominator() - Sum) / UnknownProbCount);
208 if (Sum <= BranchProbability::getDenominator())
212 if (Sum == 0) {
219 I->N = (I->N * uint64_t(D) + Sum / 2) / Sum
[all...] |
| /external/llvm/unittests/Analysis/ |
| ScalarEvolutionTest.cpp | 153 SmallVector<const SCEV *, 16> Sum;
154 Sum.push_back(SE.getMulExpr(A[0], B[0]));
155 EXPECT_EQ(Product->getOperand(0), SE.getAddExpr(Sum));
156 Sum.clear();
161 Sum.push_back(SE.getMulExpr(A[1], B[0]));
162 Sum.push_back(SE.getMulExpr(A[0], B[1]));
163 Sum.push_back(SE.getMulExpr(A[1], B[1]));
164 EXPECT_EQ(Product->getOperand(1), SE.getAddExpr(Sum));
165 Sum.clear();
167 Sum.push_back(SE.getMulExpr(A[2], B[0]))
[all...] |
| /external/chromium-trace/catapult/telemetry/telemetry/ |
| decorators_unittest.py | 31 def Sum():
34 self.assertEquals({'bar'}, decorators.GetDisabledAttributes(Sum))
132 def Sum():
135 self.assertEquals({'minus', 'power'}, decorators.GetEnabledAttributes(Sum))
|
| /external/chromium-trace/catapult/third_party/pipeline/pipeline/ |
| common.py | 127 class Sum(pipeline.Pipeline):
128 """Returns the sum of all values."""
132 raise TypeError('sum expected at least 1 argument, got 0')
136 return sum(args)
177 the output list is the sum of the lengths of all input lists.
|
| /external/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 107 Value *Sum =
111 ReturnInst::Create(M->getContext(), Sum, RecurseBB);
|
| /external/llvm/lib/Target/AMDGPU/ |
| SIInsertWaits.cpp | 252 // Get the hardware counter increments and sum them up
255 unsigned Sum = 0;
261 Sum += Increment.Array[i];
265 if (Sum == 0) {
|
| /external/pdfium/third_party/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 | 130 static double Sum(Isolate* isolate, int n) {
142 TEST(Sum) {
145 CHECK_EQ(5050.0, Sum(CcTest::i_isolate(), 100));
182 "function Cons2(x, y) { this.sum = x + y; }\n"
183 "if (new Cons2(3,4).sum == 7) r+=256;"; // 256
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 202 // Compute the sum of all weights to later decide whether they need to
219 // If the sum of weights does not fit in 32 bits, scale every weight down
536 uint32_t Sum = 0;
540 uint32_t PrevSum = Sum;
542 Sum += Weight;
543 assert(Sum >= PrevSum); (void) PrevSum;
546 return Sum;
557 uint32_t Sum = 0;
564 uint32_t PrevSum = Sum;
566 Sum += Weight
[all...] |
| /external/lzma/CPP/7zip/UI/Common/ |
| Bench.cpp | 331 UInt64 Sum;
337 Sum = 0;
343 Sum += v - Prev;
345 return Sum;
[all...] |
| /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...] |
