| /external/valgrind/memcheck/tests/ |
| metadata.stdout.exp | 13 sum != 0
|
| /packages/apps/Dialer/java/com/android/incallui/answer/impl/classifier/ |
| AnglesClassifier.java | 39 * The final result is the minimum of angle variance of the whole stroke and the sum of angle
96 private float sum; field in class:AnglesClassifier.Data
112 sum = secondSum = 0.0f;
152 firstAngleVariance = getAnglesVariance(sumSquares, sum, count);
162 sum += difference;
170 public float getAnglesVariance(float sumSquares, float sum, float count) {
171 return sumSquares / count - (sum / count) * (sum / count);
175 float anglesVariance = getAnglesVariance(sumSquares, sum, count);
|
| /external/skia/src/opts/ |
| SkBitmapProcState_opts_SSE2.cpp | 102 __m128i sum = _mm_add_epi16(a00a10, a01a11); local
105 __m128i shifted = _mm_shuffle_epi32(sum, 0xEE);
108 sum = _mm_add_epi16(sum, shifted);
111 sum = _mm_srli_epi16(sum, 8);
113 // Pack lower 4 16 bit values of sum into lower 4 bytes.
114 sum = _mm_packus_epi16(sum, zero);
117 *colors++ = _mm_cvtsi128_si32(sum);
212 __m128i sum = _mm_add_epi16(a00a10, a01a11); local
[all...] |
| /external/skqp/src/opts/ |
| SkBitmapProcState_opts_SSE2.cpp | 102 __m128i sum = _mm_add_epi16(a00a10, a01a11); local
105 __m128i shifted = _mm_shuffle_epi32(sum, 0xEE);
108 sum = _mm_add_epi16(sum, shifted);
111 sum = _mm_srli_epi16(sum, 8);
113 // Pack lower 4 16 bit values of sum into lower 4 bytes.
114 sum = _mm_packus_epi16(sum, zero);
117 *colors++ = _mm_cvtsi128_si32(sum);
212 __m128i sum = _mm_add_epi16(a00a10, a01a11); local
[all...] |
| /external/eigen/doc/examples/ |
| Tutorial_ReductionsVisitorsBroadcasting_maxnorm.cpp | 13 float maxNorm = mat.colwise().sum().maxCoeff(&maxIndex);
15 std::cout << "Maximum sum at position " << maxIndex << std::endl;
19 std::cout << "And its sum is is: " << maxNorm << std::endl;
|
| tut_arithmetic_redux_basic.cpp | 10 cout << "Here is mat.sum(): " << mat.sum() << endl;
|
| /external/eigen/doc/ |
| tutorial.cpp | 43 std::cout << "*** Step 7 ***\n m4.sum(): " << m4.sum() << std::endl;
44 std::cout << "m4.col(2).sum(): " << m4.col(2).sum() << std::endl;
45 std::cout << "m4.colwise().sum():\n" << m4.colwise().sum() << std::endl;
46 std::cout << "m4.rowwise().sum():\n" << m4.rowwise().sum() << std::endl;
|
| /external/fec/ |
| dotprod_sse2_assist.s | 5 # long sum = 0;
8 # sum += *a++ + *b++;
9 # return sum;
28 pxor %xmm0,%xmm0 # clear running sum (in two 32-bit halves)
|
| sumsq_av.c | 1 /* Compute the sum of the squares of a vector of signed shorts
14 long long sum; local
35 /* A single vec_msum cannot overflow, but we have to sum it with
69 /* Extract sum and carries from right-hand words and combine into result */
71 sum = s.w[3];
74 sum += (long long)s.w[3] << 32;
76 return sum;
|
| /external/libmojo/third_party/catapult/devil/devil/utils/ |
| host_utils.py | 13 running_size += sum([os.path.getsize(os.path.join(root, f))
|
| /external/webrtc/webrtc/modules/audio_processing/aec/ |
| echo_cancellation_internal.h | 32 int sum; member in struct:__anon44150
|
| /external/zopfli/src/zopfli/ |
| tree.c | 73 unsigned sum = 0; local
77 sum += count[i];
79 log2sum = (sum == 0 ? log(n) : log(sum)) * kInvLog2;
|
| /frameworks/support/leanback/src/androidTest/java/androidx/leanback/widget/ |
| PagingIndicatorTest.java | 60 int sum = selectedX[0] + selectedX[pageCount - 1]; local
62 assertEquals("Selected dots are not symmetric", sum,
67 sum = leftX[0] + rightX[pageCount - 1];
69 assertEquals("Deselected dots are not symmetric", sum,
|
| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_feature_matching.h | 31 DB_API void db_SignedSquareNormCorr21x21_PreAlign_u(short *patch,const unsigned char * const *f_img,int x_f,int y_f,float *sum,float *recip);
32 DB_API void db_SignedSquareNormCorr11x11_PreAlign_u(short *patch,const unsigned char * const *f_img,int x_f,int y_f,float *sum,float *recip);
50 float sum; member in class:db_PointInfo_f
77 float sum; member in class:db_PointInfo_u
|
| /test/vts/utils/python/coverage/ |
| arc_summary.py | 58 Uses the property that the sum of counts of arcs entering a
59 node is equal to the sum of counts of arcs leaving a node. The
75 in_flow = sum(a.count for a in self.src_block.entry_arcs)
76 out_flow = sum(a.count for a in self.src_block.exit_arcs
83 out_flow = sum(a.count for a in self.dst_block.exit_arcs)
84 in_flow = sum(a.count for a in self.dst_block.entry_arcs
|
| /art/test/655-checker-simd-arm-opt/src/ |
| Main.java | 76 int sum = 0; local
78 sum += b[i] + s[i] + c[i] + a[i] + l[i] + f[i] + d[i];
80 return sum;
|
| /device/linaro/bootloader/edk2/StdLib/Include/netinet/ |
| in.h | 506 u_int32_t sum;
local
508 sum = lenproto +
514 sum = (u_int16_t)(sum >> 16) + (u_int16_t)(sum /*& 0xffff*/);
516 if (sum > 0xffff)
517 sum -= 0xffff;
519 return (sum);
530 u_int32_t sum = a + b;
local
532 if (sum > 0xffff)
[all...] |
| /external/autotest/client/common_lib/cros/ |
| perf_stat_lib.py | 57 return round(float(sum(num_list)) / len(num_list) , 2)
72 mean = float(sum(num_list)) / n
73 variance = sum([(elem - mean) ** 2 for elem in num_list]) / (n -1)
|
| /external/autotest/client/tools/ |
| avgtime | 5 sum = 0
11 sum += x
13 average = sum / count
|
| /external/e2fsprogs/intl/ |
| xsize.h | 52 /* Sum of two sizes, with overflow check. */
59 size_t sum = size1 + size2; local
60 return (sum >= size1 ? sum : SIZE_MAX);
63 /* Sum of three sizes, with overflow check. */
73 /* Sum of four sizes, with overflow check. */
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| FuturesCombineBenchmark.java | 87 int sum = 0;
89 sum += impl.combine(callable, INLINE_EXECUTOR, futures).get();
91 return sum;
102 int sum = 0;
104 sum += impl.combine(callable, INLINE_EXECUTOR, futures).get();
106 return sum;
112 int sum = 0;
119 sum += combined.get();
121 return sum;
127 int sum = 0
[all...] |
| /external/iproute2/netem/ |
| stats.c | 24 double mu=0.0, sigma=0.0, sumsquare=0.0, sum=0.0, top=0.0, rho=0.0; local
40 sum += x[i];
43 mu = sum/(double)n;
|
| /external/libopus/silk/tests/ |
| test_unit_LPC_inv_pred_gain.c | 55 /* If the sum of absolute values is less than 1, the filter
63 double sum = 0; local
65 sum += y[ j ]*A_Q12[ j ];
70 y[ 0 ] = sum*(1./4096);
|
| /external/libvpx/libvpx/vpx_dsp/ |
| deblock.c | 126 int sum = 0; local
137 sum += s[i];
145 sum += x;
150 if (sumsq * 15 - sum * sum < flimit) {
151 d[c & 15] = (8 + sum + s[c]) >> 4;
168 int sum = 0; local
180 sum += s[i * pitch];
185 sum += s[7 * pitch] - s[-8 * pitch];
188 if (sumsq * 15 - sum * sum < flimit)
[all...] |
| /external/skia/tools/ |
| Stats.h | 35 double sum = 0.0; local
37 sum += samples[i];
39 mean = sum / n;
|
