/external/chromium_org/v8/test/mjsunit/ |
H A D | arguments-call-apply.js | 28 function sum(a, b, c) { function 36 // Try invoking call before sum has been compiled lazily. 37 assertEquals(6, sum.call(this, 1, 2, 3), "lazy call"); 39 assertEquals(6, sum(1, 2, 3), "normal"); 40 assertEquals(6, sum.call(this, 1, 2, 3), "call"); 41 assertEquals(6, sum.apply(this, [1, 2, 3]), "apply");
|
H A D | sum-0-plus-undefined-is-NaN.js | 34 function sum(a, b) { return a + b; } function 38 assertEquals(expectNaN, isNaN(sum(x, y))); 40 %OptimizeFunctionOnNextCall(sum); 41 assertEquals(expectNaN, isNaN(sum(x, y)));
|
/external/chromium_org/v8/test/webkit/ |
H A D | dfg-put-scoped-var-backward-flow.js | 28 function sum(nums) { function 37 shouldBe("sum([2147483646, 2147483644])", "4294967290");
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/ubench/ |
H A D | loop-sum.js | 2 var sum = 0; variable 4 sum = i + count;
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseRedux.h | 17 SparseMatrixBase<Derived>::sum() const function in class:Eigen::SparseMatrixBase 29 SparseMatrix<_Scalar,_Options,_Index>::sum() const function in class:Eigen::SparseMatrix 32 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum(); 37 SparseVector<_Scalar,_Options,_Index>::sum() const function in class:Eigen::SparseVector 40 return Matrix<Scalar,1,Dynamic>::Map(&m_data.value(0), m_data.size()).sum();
|
/external/chromium_org/v8/test/mjsunit/compiler/ |
H A D | regress-serialized-slots.js | 51 function sum(x, y) { function 56 runner(sum.bind(this, n), n + 10);
|
/external/libvpx/libvpx/vp9/encoder/ |
H A D | vp9_encodeframe.h | 25 int sum; member in struct:__anon24944
|
/external/valgrind/main/exp-sgcheck/tests/ |
H A D | globalerr.c | 10 short sum; local 12 sum += a[i] * b[i]; 14 return 1 & ((unsigned int)sum / 1000000);
|
H A D | preen_invars.c | 11 int i, r, sum = 0; local 22 sum += im_a_global_array[i]; 42 if (sum & 1) printf("%s bar %d\n", "foo", sum & 1); else 43 printf("foo %s %d\n", "bar", 1 - (sum & 1));
|
/external/chromium_org/third_party/opus/src/silk/ |
H A D | inner_prod_aligned.c | 42 opus_int32 sum = 0; local 44 sum = silk_ADD_RSHIFT32( sum, silk_SMULBB( inVec1[ i ], inVec2[ i ] ), scale ); 46 return sum;
|
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/ |
H A D | dot_product_with_scale.c | 17 int32_t sum = 0; local 22 sum += (vector1[i + 0] * vector2[i + 0]) >> scaling; 23 sum += (vector1[i + 1] * vector2[i + 1]) >> scaling; 24 sum += (vector1[i + 2] * vector2[i + 2]) >> scaling; 25 sum += (vector1[i + 3] * vector2[i + 3]) >> scaling; 28 sum += (vector1[i] * vector2[i]) >> scaling; 31 return sum;
|
H A D | filter_ar_fast_q12.c | 29 int32_t sum = 0; local 32 sum += coefficients[j] * data_out[i - j]; 36 output -= sum;
|
/external/libopus/silk/ |
H A D | inner_prod_aligned.c | 42 opus_int32 sum = 0; local 44 sum = silk_ADD_RSHIFT32( sum, silk_SMULBB( inVec1[ i ], inVec2[ i ] ), scale ); 46 return sum;
|
/external/speex/libspeex/ |
H A D | lsp_bfin.h | 45 spx_word32_t sum; local 58 "R3 = W[P0--] (X);\n\t" /* R3: sum */ 80 : "=&d" (sum) 84 return sum;
|
/external/valgrind/main/callgrind/tests/ |
H A D | clreq.c | 7 int some_work(int sum) argument 11 for(i=0;i<10;i++) sum += i; /* some dummy work */ 13 return sum; 18 int sum = some_work(0); local 22 sum += some_work(sum); 26 sum += some_work(sum); 30 return some_work(sum); 35 int sum local [all...] |
/external/valgrind/main/memcheck/tests/ |
H A D | clientperm.c | 16 int i, sum, m; local 18 sum = 0; 28 sum += aa[i]; 29 printf("sum is %s\n", sum > 0 ? "positive" : "non-positive"); 35 sum += aa[i]; 36 printf("sum is %s\n", sum > 0 ? "positive" : "non-positive");
|
H A D | inline.c | 16 int sum; local 18 sum = addemup(a); 19 printf("sum is %d\n", sum);
|
H A D | metadata.c | 13 int i, sum, res; local 39 sum = 100; 41 sum += b[i]; 43 /* V should yelp at this point, that sum is undefined. */ 44 if (sum == 0) 45 printf("sum == 0\n"); 47 printf("sum != 0\n");
|
/external/valgrind/main/memcheck/tests/linux/ |
H A D | lsframe1.c | 16 int i, sum; local 21 sum = 0; 23 sum += arr[i]; 24 fprintf(stderr, "lsframe1: done, result is %d\n", sum);
|
/external/valgrind/main/perf/ |
H A D | sarp.c | 32 int i, sum = 0; local 43 sum += f(i & 0xff); 45 return ( sum == 0xdeadbeef ? 1 : 0 );
|
/external/chromium_org/media/cast/test/utility/ |
H A D | test_util.cc | 17 double sum = 0.0; local 22 sum += values[i]; 25 mean = sum / num_values; 27 sqrt(std::max(0.0, num_values * sqr_sum - sum * sum)) / num_values;
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | QuadraticParameterization_TestUtility.cpp | 14 double sum = xx + xy + yy + x + y + c; local 15 return approximately_zero(sum);
|
/external/chromium_org/third_party/skia/tools/ |
H A D | Stats.h | 22 double sum = 0.0; local 24 sum += samples[i]; 26 mean = sum / n;
|
/external/clang/test/CodeGenCXX/ |
H A D | microsoft-abi-byval-vararg.cpp | 15 int sum = 0; local 17 sum += va_arg(ap, int); 19 return sum;
|
/external/skia/experimental/Intersection/ |
H A D | QuadraticParameterization_TestUtility.cpp | 14 double sum = xx + xy + yy + x + y + c; local 15 return approximately_zero(sum);
|