| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| armVCM4P10_PredictIntraDC4x4.c | 51 int x, y, Sum=0, Count = 0;
57 Sum += pSrcLeft[y*leftStep];
65 Sum += pSrcAbove[x];
71 Sum = 128;
75 Sum = (Sum + 2) >> 2;
79 Sum = (Sum + 4) >> 3;
85 pDst[y*dstStep+x] = (OMX_U8)Sum;
|
| omxVCM4P10_PredictIntraChroma_8x8.c | 51 int x, y, Sum=0, Count = 0;
57 Sum += pSrcAbove[x];
65 Sum += pSrcLeft[y*leftStep];
71 Sum = 128;
75 Sum = (Sum + 2) >> 2;
81 pDst[y*dstStep+x] = (OMX_U8)Sum;
113 int x, y, Sum=0, Count = 0;
119 Sum += pSrcLeft[y*leftStep];
127 Sum += pSrcAbove[x]
[all...] |
| omxVCM4P10_PredictIntra_16x16.c | 89 int x,y,Sum,Count;
132 Sum = 0;
138 Sum += pSrcLeft[y*leftStep];
146 Sum += pSrcAbove[x];
152 Sum = 128;
156 Sum = (Sum + 8) >> 4;
160 Sum = (Sum + 16) >> 5;
166 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 | 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 )
70 Value Sum() const {
|
| /external/llvm/lib/Analysis/ |
| AliasAnalysisCounter.cpp | 42 void printLine(const char *Desc, unsigned Val, unsigned Sum) {
44 << Val*100/Sum << "%)\n";
|
| BranchProbabilityInfo.cpp | 541 uint32_t Sum = 0;
545 uint32_t PrevSum = Sum;
547 Sum += Weight;
548 assert(Sum > PrevSum); (void) PrevSum;
551 return Sum;
562 uint32_t Sum = 0;
569 uint32_t PrevSum = Sum;
571 Sum += Weight;
572 assert(Sum > PrevSum); (void) PrevSum;
581 if (BranchProbability(MaxWeight, Sum) > BranchProbability(4, 5)
[all...] |
| ScalarEvolutionExpander.cpp | 315 const SCEV *Sum = NoAddRecs.empty() ?
319 // the sum into a single value, so just use that.
321 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Sum))
323 else if (!Sum->isZero())
324 Ops.push_back(Sum);
720 Value *Sum = nullptr;
725 if (!Sum) {
727 Sum = expand(Op);
729 } else if (PointerType *PTy = dyn_cast<PointerType>(Sum->getType())) {
730 // The running sum expression is a pointer. Try to form a getelementpt
[all...] |
| /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/chromium_org/v8/test/cctest/ |
| test-compiler.cc | 133 static double Sum(Isolate* isolate, int n) {
145 TEST(Sum) {
148 CHECK_EQ(5050.0, Sum(CcTest::i_isolate(), 100));
185 "function Cons2(x, y) { this.sum = x + y; }\n"
186 "if (new Cons2(3,4).sum == 7) r+=256;"; // 256
|
| /external/llvm/examples/ParallelJIT/ |
| ParallelJIT.cpp | 106 Value *Sum =
110 ReturnInst::Create(M->getContext(), Sum, RecurseBB);
|
| /external/llvm/lib/Target/R600/ |
| SIInsertWaits.cpp | 206 // Get the hardware counter increments and sum them up
208 unsigned Sum = 0;
212 Sum += Increment.Array[i];
216 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/chromium_org/base/ |
| bind_unittest.cc | 174 int Sum(int a, int b, int c, int d, int e, int f) {
253 Callback<int(void)> c0 = Bind(&Sum, 32, 16, 8, 4, 2, 1);
256 Callback<int(int)> c1 = Bind(&Sum, 32, 16, 8, 4, 2);
259 Callback<int(int,int)> c2 = Bind(&Sum, 32, 16, 8, 4);
262 Callback<int(int,int,int)> c3 = Bind(&Sum, 32, 16, 8);
265 Callback<int(int,int,int,int)> c4 = Bind(&Sum, 32, 16);
268 Callback<int(int,int,int,int,int)> c5 = Bind(&Sum, 32);
271 Callback<int(int,int,int,int,int,int)> c6 = Bind(&Sum);
277 Callback<int(int,int,int,int,int,int)> c6 = Bind(&Sum);
|
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-open-type-private.hh | 646 uint32_t Sum = 0L;
650 Sum += *Table++;
651 return Sum;
|
| /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
| bitstream.c | [all...] |
| /external/clang/test/SemaCXX/ |
| constant-expression-cxx11.cpp | 128 constexpr int Sum(int a = 0, const int &b = 0, const int *c = &z, char d = 0) {
134 static_assert(Sum() == 0, "");
135 static_assert(Sum(1) == 1, "");
136 static_assert(Sum(1, four) == 5, "");
137 static_assert(Sum(1, eight, &twentyseven) == 36, "");
138 static_assert(Sum(1, 2, &four, eight) == 15, "");
480 constexpr auto Sum(Iter begin, Iter end) -> decltype(+*begin) {
481 return begin == end ? 0 : *begin + Sum(begin+1, end);
486 constexpr int sum_xs = Sum(begin(xs), end(xs));
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-open-type-private.hh | 649 uint32_t Sum = 0L;
653 Sum += *Table++;
654 return Sum;
|
| /external/libvpx/libvpx/vp8/encoder/ |
| bitstream.c | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 77 uint64_t Sum = Mass + X.Mass;
78 Mass = Sum < Mass ? UINT64_MAX : Sum;
350 uint64_t Total; ///< Sum of all weights.
702 /// - Normalize the distribution: scale weights down so that their sum
769 /// 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...] |
