| /device/linaro/bootloader/edk2/StdLib/BsdSocketLib/ |
| ns_addr.c | 225 long sum;
local
229 d = 0; e = 0; sum = 0;
232 sum = sum*oldbase + (long) input[d];
233 e += (sum > 0);
234 input[d++] = sum / newbase;
235 sum %= newbase;
237 result[--reslen] = (u_char)sum; /* accumulate remainder */
|
| /external/aac/libFDK/include/ |
| fixpoint_math.h | 437 * \return saturated sum of a and b.
441 LONG sum; local
443 sum = (LONG)(SHORT)a + (LONG)(SHORT)b;
444 sum = fMax(fMin((INT)sum, (INT)MAXVAL_SGL), (INT)MINVAL_SGL);
445 return (FIXP_SGL)(SHORT)sum;
452 * \return saturated sum of a and b.
456 LONG sum; local
458 sum = (LONG)(a>>1) + (LONG)(b>>1);
459 sum = fMax(fMin((INT)sum, (INT)(MAXVAL_DBL>>1)), (INT)(MINVAL_DBL>>1))
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/integration/ |
| TrapezoidIntegrator.java | 86 double sum = 0; local
90 sum += f.value(x);
93 // add the new sum to previously calculated result
94 s = 0.5 * (s + sum * spacing);
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/special/ |
| Gamma.java | 103 double sum = 0.0; local
105 sum = sum + (LANCZOS[i] / (x + i));
107 sum = sum + LANCZOS[0];
111 HALF_LOG_2_PI + FastMath.log(sum / x);
178 double sum = an; // partial sum local
179 while (FastMath.abs(an/sum) > epsilon && n < maxIterations && sum < Double.POSITIVE_INFINITY)
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/descriptive/moment/ |
| Mean.java | 23 import org.apache.commons.math.stat.descriptive.summary.Sum;
29 * mean = sum(x_i) / n
156 Sum sum = new Sum(); local
160 double xbar = sum.evaluate(values, begin, length) / sampleSize;
204 Sum sum = new Sum(); local
207 double sumw = sum.evaluate(weights,begin,length)
[all...] |
| /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/avb/test/ |
| avb_sysdeps_posix_testing.cc | 113 size_t sum = 0; local
115 sum += block_it.second.size;
119 sum,
|
| /external/blktrace/ |
| stats.h | 31 __u64 sum; member in struct:minmax
40 mm->sum = 0;
47 mm->sum += value;
58 dst->sum += src->sum;
69 mm->sum = cpu_to_be64(mm->sum);
78 return (mm->sum / (double)mm->num);
85 return ((mm->sos - ((mm->sum * mm->sum) / num)) / num)
[all...] |
| /external/clang/test/SemaCXX/ |
| warn-infinite-recursion.cpp | 95 // sum<0>() is instantiated, does recursively call itself, but never runs.
97 int sum() { function
98 return value + sum<value/2>();
102 int sum<1>() { return 1; } function
107 return sum<x - y>(); // This instantiates sum<0>() even if never called.
|
| /external/clang/test/SemaTemplate/ |
| cxx1z-fold-expressions.cpp | 3 template<typename ...T> constexpr auto sum(T ...t) { return (... + t); } function
8 static_assert(sum(1, 2, 3, 4, 5) == 15);
|
| /external/dnsmasq/src/ |
| bpf.c | 172 u32 i, sum; local
213 for (sum = 0, i = 0; i < sizeof(struct ip) / 2; i++)
214 sum += ((u16 *)&ip)[i];
215 while (sum>>16)
216 sum = (sum & 0xffff) + (sum >> 16);
217 ip.ip_sum = (sum == 0xffff) ? sum : ~sum;
[all...] |
| /external/eigen/Eigen/src/IterativeLinearSolvers/ |
| BasicPreconditioners.h | 171 RealScalar sum = mat.innerVector(j).squaredNorm(); local
172 if(sum>RealScalar(0))
173 m_invdiag(j) = RealScalar(1)/sum;
|
| /external/eigen/unsupported/Eigen/src/AutoDiff/ |
| AutoDiffVector.h | 63 // FIXME here we could return an expression of the sum
64 Scalar sum() const { /*std::cerr << "sum \n\n";*/ /*std::cerr << m_jacobian.rowwise().sum() << "\n\n";*/ return Scalar(m_values.sum(), m_jacobian.rowwise().sum()); } function in class:Eigen::AutoDiffVector
|
| /external/eigen/unsupported/Eigen/src/NonLinearOptimization/ |
| lmpar.h | 82 Scalar sum = 0.; local
84 sum += r(i,j) * wa1[i];
85 wa1[j] = (wa1[j] - sum) / r(j,j);
|
| /external/eigen/unsupported/test/ |
| cxx11_tensor_of_strings.cpp | 124 Tensor<std::string, 1> sum = data1 + data2; local
129 VERIFY_IS_EQUAL(sum(i), expected);
|
| /external/f2fs-tools/fsck/ |
| segment.c | 20 struct f2fs_summary *sum, int type)
43 update_sum_entry(sbi, *to, sum);
49 struct f2fs_summary sum; local
56 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version);
57 reserve_new_block(sbi, &dn->data_blkaddr, &sum, type);
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| IteratorBenchmark.java | 53 int sum = 0; local
56 sum += array[index].hashCode();
59 return sum;
63 int sum = 0; local
66 sum += array[index].hashCode();
69 return sum;
73 int sum = 0; local
76 sum += value.hashCode();
79 return sum;
83 int sum = 0 local
93 int sum = 0; local
103 int sum = 0; local
113 int sum = 0; local
123 int sum = 0; local
133 int sum = 0; local
[all...] |
| MultisetIteratorBenchmark.java | 65 int sum = 0; local
68 sum += value.hashCode();
71 return sum;
75 int sum = 0; local
78 sum += value.hashCode();
81 return sum;
85 int sum = 0; local
88 sum += value.hashCode();
91 return sum;
|
| /external/icu/icu4c/source/i18n/ |
| collationdatawriter.cpp | 191 // Sum of the sizes of the data items which are
193 int32_t sum = headerSize + (indexesLength + reorderCodesLength) * 4; local
194 if((sum & 7) != 0) {
|
| /external/libchrome/base/metrics/ |
| histogram_samples.cc | 86 IncreaseSum(other.sum());
94 int64_t sum; local
97 if (!iter->ReadInt64(&sum) || !iter->ReadInt(&redundant_count))
100 IncreaseSum(sum);
109 IncreaseSum(-other.sum());
117 if (!pickle->WriteInt64(sum()))
138 subtle::NoBarrier_AtomicIncrement(&meta_->sum, diff);
140 meta_->sum += diff;
|
| /external/libgsm/src/ |
| add.c | 25 longword sum = (longword)a + (longword)b; local
26 return saturate(sum);
|
| /external/libopus/celt/x86/ |
| pitch_sse.c | 43 void xcorr_kernel_sse(const opus_val16 *x, const opus_val16 *y, opus_val32 sum[4], int len)
47 xsum1 = _mm_loadu_ps(sum);
75 _mm_storeu_ps(sum,_mm_add_ps(xsum1,xsum2));
94 /* Horizontal sum */
113 __m128 sum; local
114 sum = _mm_setzero_ps();
120 sum = _mm_add_ps(sum,_mm_mul_ps(xi, yi));
122 /* Horizontal sum */
123 sum = _mm_add_ps(sum, _mm_movehl_ps(sum, sum))
[all...] |
| /external/libopus/silk/fixed/x86/ |
| prefilter_FIX_sse.c | 64 register opus_int32 sum; local
110 sum = (coef_Q13_8 * state_8) >> 16;
111 sum += (coef_Q13_9 * state_9) >> 16;
114 sum += _mm_cvtsi128_si32( xmm_tempa);
115 res_Q2[ n ] = silk_LSHIFT( (opus_int32)input[ n ], 2 ) - silk_RSHIFT_ROUND( ( 5 + sum ), 9);
|
| /external/libopus/silk/ |
| stereo_LR_to_MS.c | 51 opus_int32 sum, diff, smooth_coef_Q16, pred_Q13[ 2 ], pred0_Q13, pred1_Q13; local
64 sum = x1[ n - 2 ] + (opus_int32)x2[ n - 2 ];
66 mid[ n ] = (opus_int16)silk_RSHIFT_ROUND( sum, 1 );
80 sum = silk_RSHIFT_ROUND( silk_ADD_LSHIFT( mid[ n ] + (opus_int32)mid[ n + 2 ], mid[ n + 1 ], 1 ), 2 );
81 LP_mid[ n ] = sum;
82 HP_mid[ n ] = mid[ n + 1 ] - sum;
89 sum = silk_RSHIFT_ROUND( silk_ADD_LSHIFT( side[ n ] + (opus_int32)side[ n + 2 ], side[ n + 1 ], 1 ), 2 );
90 LP_side[ n ] = sum;
91 HP_side[ n ] = side[ n + 1 ] - sum;
210 sum = silk_LSHIFT( silk_ADD_LSHIFT( mid[ n ] + (opus_int32)mid[ n + 2 ], mid[ n + 1 ], 1 ), 9 ); /* (…)
[all...] |
| /external/libvpx/libvpx/test/ |
| blockiness_test.cc | 113 int sum = 0; local
117 sum += data[w + h * stride];
120 sum += data[w + h * stride] - data[w - taps + h * stride];
121 data[w - half_taps + h * stride] = (sum + half_taps) / taps;
126 sum += data[h + w * stride];
129 sum += data[w + h * stride] - data[(h - taps) * stride + w];
130 data[(h - half_taps) * stride + w] = (sum + half_taps) / taps;
|
