| /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_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...] |
| 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...] |
| /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/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...] |
| SpillPlacement.cpp | 91 /// sum can be less than 2 when the variable is not live into / out of some
103 // Actually, we must spill if Bias < sum(weights).
104 // It may be worth it to compute the weight sum here?
147 // Compute the weighted sum of inputs.
148 float Sum = Bias;
150 Sum += I->first * nodes[I->second].Value;
152 // The weighted sum is going to be in the range [-2;2]. Ideally, we should
153 // simply set Value = sign(Sum), but we will add a dead zone around 0 for
157 // 2. It helps tame rounding errors when the links nominally sum to 0.
160 if (Sum < -Thres
[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/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/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/opencv/cxcore/src/ |
| cxsumpixels.cpp | 45 * Find sum of pixels in the ROI *
169 sum[0] = (sumtype)tmp##0
172 sum[0] = (sumtype)tmp##0; \
173 sum[1] = (sumtype)tmp##1;
176 sum[0] = (sumtype)tmp##0; \
177 sum[1] = (sumtype)tmp##1; \
178 sum[2] = (sumtype)tmp##2;
181 sum[0] = (sumtype)tmp##0; \
182 sum[1] = (sumtype)tmp##1; \
183 sum[2] = (sumtype)tmp##2;
393 CvScalar sum = {{0,0,0,0}}; local
[all...] |
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 441 uint32_t Sum = 0;
445 uint32_t PrevSum = Sum;
447 Sum += Weight;
448 assert(Sum > PrevSum); (void) PrevSum;
451 return Sum;
462 uint32_t Sum = 0;
469 uint32_t PrevSum = Sum;
471 Sum += Weight;
472 assert(Sum > PrevSum); (void) PrevSum;
481 if (BranchProbability(MaxWeight, Sum) > BranchProbability(4, 5)
[all...] |
| ScalarEvolutionExpander.cpp | 319 const SCEV *Sum = NoAddRecs.empty() ?
323 // the sum into a single value, so just use that.
325 if (const SCEVAddExpr *Add = dyn_cast<SCEVAddExpr>(Sum))
327 else if (!Sum->isZero())
328 Ops.push_back(Sum);
728 Value *Sum = 0;
733 if (!Sum) {
735 Sum = expand(Op);
737 } else if (PointerType *PTy = dyn_cast<PointerType>(Sum->getType())) {
738 // The running sum expression is a pointer. Try to form a getelementpt
[all...] |
| AliasAnalysisCounter.cpp | 43 void printLine(const char *Desc, unsigned Val, unsigned Sum) {
45 << Val*100/Sum << "%)\n";
|
| AliasAnalysisEvaluator.cpp | 254 static void PrintPercent(unsigned Num, unsigned Sum) {
255 errs() << "(" << Num*100ULL/Sum << "."
256 << ((Num*1000ULL/Sum) % 10) << "%)\n";
|
| /external/libvpx/libvpx/vp8/encoder/ppc/ |
| csystemdependent.c | 58 extern unsigned int vp8_get8x8var_c(unsigned char *src_ptr, int source_stride, unsigned char *ref_ptr, int recon_stride, unsigned int *SSE, int *Sum);
118 extern unsigned int vp8_get8x8var_ppc(unsigned char *src_ptr, int source_stride, unsigned char *ref_ptr, int recon_stride, unsigned int *SSE, int *Sum);
119 extern unsigned int vp8_get16x16var_ppc(unsigned char *src_ptr, int source_stride, unsigned char *ref_ptr, int recon_stride, unsigned int *SSE, int *Sum);
|
| /external/chromium/base/ |
| bind_unittest.cc | 158 int Sum(int a, int b, int c, int d, int e, int f) {
226 Callback<int(void)> c0 = Bind(&Sum, 32, 16, 8, 4, 2, 1);
229 Callback<int(int)> c1 = Bind(&Sum, 32, 16, 8, 4, 2);
232 Callback<int(int,int)> c2 = Bind(&Sum, 32, 16, 8, 4);
235 Callback<int(int,int,int)> c3 = Bind(&Sum, 32, 16, 8);
238 Callback<int(int,int,int,int)> c4 = Bind(&Sum, 32, 16);
241 Callback<int(int,int,int,int,int)> c5 = Bind(&Sum, 32);
244 Callback<int(int,int,int,int,int,int)> c6 = Bind(&Sum);
|
| /external/llvm/examples/Fibonacci/ |
| fibonacci.cpp | 82 Value *Sum = BinaryOperator::CreateAdd(CallFibX1, CallFibX2,
86 ReturnInst::Create(Context, Sum, RecurseBB);
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.JavaExtensions/ |
| StringTokenizer.cs | 70 return new string[] { token, str[EnumerableExtensions.Sum(EnumerableExtensions.Select(EnumerableExtensions.Take(_tokens, i + 1),
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| StringTokenizer.cs | 71 return new string[] { token, str[_tokens.Take( i + 1 ).Select( t => t.Length + 1 ).Sum() - 1].ToString() };
|
| /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/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Misc/ |
| Stats.cs | 109 public static int sum(int[] X) { method in class:Antlr.Runtime.Misc.Stats
110 return EnumerableExtensions.Sum(X);
|
| /external/libvpx/libvpx/vp8/common/x86/ |
| variance_ssse3.c | 23 int *Sum
32 int *sum,
42 int *sum,
52 int *sum,
64 int *sum,
|
| variance_sse2.c | 30 int *sum,
41 int *Sum
55 int *Sum
64 int *Sum
75 int *sum,
85 int *sum,
95 int *sum,
105 int *sum,
115 int *sum,
125 int *sum,
[all...] |
| variance_mmx.c | 46 int *Sum
55 int *Sum
65 int *sum,
77 int *sum,
|
| /external/llvm/lib/Target/R600/ |
| SIInsertWaits.cpp | 198 // Get the hardware counter increments and sum them up
200 unsigned Sum = 0;
204 Sum += Increment.Array[i];
208 if (Sum == 0)
|
