| /toolchain/binutils/binutils-2.27/ld/ |
| ldctor.c | 159 const char *n2; local
166 n2 = (*pe2)->name;
167 if (n2 == NULL)
168 n2 = "";
175 prio2 = ctor_prio (n2);
|
| /external/libvpx/libvpx/vpx_dsp/mips/ |
| idct32x32_msa.c | 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3);
20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, m0, n0, m1, n1, m2, n2, m3,
24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8);
29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3);
31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3, m0, n0, m1, n1, m2, n2, m3,
36 ST_SH4(m2, n2, m3, n3, (tmp_buf + 20 * 8), 8);
243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7 local
542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
[all...] |
| convolve8_avg_dspr2.c | 32 uint32_t n1, n2; local
77 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
83 "dpa.w.ph $ac1, %[n2], %[vector2b] \n\t"
91 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
97 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t"
114 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
121 "dpa.w.ph $ac1, %[n2], %[vector4b] \n\t"
131 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
143 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t"
162 [n1] "=&r"(n1), [n2] "=&r"(n2), [scratch1] "=&r"(scratch1)
188 uint32_t n1, n2; local
[all...] |
| /external/libvpx/libvpx/vp9/common/ |
| vp9_entropy.c | 1070 const int n2 = counts[i][j][k][l][TWO_TOKEN]; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_noise.c | 244 float n0, n1, n2; /* Noise contributions from the three corners */ local
307 n2 = 0.0f;
310 n2 = t2 * t2 * grad2(perm[ii + 1 + perm[jj + 1]], x2, y2);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
451 n2 = 0.0f;
454 n2 =
472 return 32.0f * (n0 + n1 + n2 + n3); /* TODO: The scale factor is preliminary! */
484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local
605 n2 = 0.0f
[all...] |
| /external/v8/src/compiler/ |
| bytecode-graph-builder.h | 72 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
73 Node* buffer[] = {n1, n2};
77 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
78 Node* buffer[] = {n1, n2, n3};
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
83 Node* buffer[] = {n1, n2, n3, n4};
|
| /external/clang/test/Sema/ |
| struct-packed-align.c | 136 extern int n2[__alignof(struct nS) == 8 ? 1 : -1];
139 extern int n2[__alignof(struct nS) == 1 ? 1 : -1];
|
| /test/vti/dashboard/src/test/java/com/android/vts/util/ |
| StatSummaryTest.java | 105 int n2 = 2000; local
112 for (int i = 0; i < n2; i++) {
|
| /prebuilts/go/darwin-x86/src/fmt/ |
| scan_test.go | 916 r := struct{ io.Reader }{strings.NewReader("1\n2\n")}
[all...] |
| /prebuilts/go/linux-x86/src/fmt/ |
| scan_test.go | 916 r := struct{ io.Reader }{strings.NewReader("1\n2\n")}
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/Stdio/ |
| vfwprintf.c | 617 int n, n2; /* handy integer (short term usage) */
local
702 * BEWARE, these `goto error' on error, PRINT uses `n2' and
741 n2 = (ep) - (p); \
742 if (n2 > (len)) \
743 n2 = (len); \
744 if (n2 > 0) \
745 PRINT((p), n2); \
746 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
793 n2 = 0; \
1596 int n, n2; \/* handy integer (short term usage) *\/ local
[all...] |
| /external/boringssl/src/crypto/fipsmodule/ec/ |
| simple.c | 310 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
337 n2 = BN_CTX_get(ctx);
350 // n1, n2
354 if (!BN_copy(n1, &a->X) || !BN_copy(n2, &a->Y)) {
358 // n2 = Y_a
367 !field_mul(group, n2, &a->Y, n0, ctx)) {
370 // n2 = Y_a * Z_b^3
397 !BN_mod_sub_quick(n6, n2, n4, p)) {
401 // n6 = n2 - n4
420 !BN_mod_add_quick(n2, n2, n4, p))
502 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /frameworks/support/compat/src/androidTest/java/androidx/core/app/ |
| NotificationCompatTest.java | 362 Notification n2 = new NotificationCompat.Builder(mActivityTestRule.getActivity()) local
378 assertNull(n2.sound);
379 assertNull(n2.vibrate);
380 assertTrue((n2.defaults & DEFAULT_LIGHTS) != 0);
381 assertTrue((n2.defaults & DEFAULT_SOUND) == 0);
382 assertTrue((n2.defaults & DEFAULT_VIBRATE) == 0);
390 assertNotNull(n2.sound);
391 assertNotNull(n2.vibrate);
392 assertTrue((n2.defaults & DEFAULT_LIGHTS) != 0);
393 assertTrue((n2.defaults & DEFAULT_SOUND) != 0)
409 Notification n2 = new NotificationCompat.Builder(mActivityTestRule.getActivity()) local
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| cnormtst.c | 1483 const UNormalizer2 *n2=unorm2_getInstance(NULL, "nfc", UNORM2_COMPOSE_CONTIGUOUS, &errorCode); local
1526 const UNormalizer2 *n2=unorm2_getNFKCInstance(&errorCode); local
1593 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
1632 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
[all...] |
| /cts/apps/CameraITS/tests/scene1/ |
| test_capture_result.py | 86 def is_close_float(n1, n2):
87 return abs(n1 - n2) < 0.05
89 def is_close_rational(n1, n2):
91 its.objects.rational_to_float(n2))
|
| /external/bzip2/ |
| huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
|
| /external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/ |
| p3-0x.cpp | 44 int n2 = f(0); member in namespace:std_example
|
| /external/clang/test/Modules/ |
| macros2.c | 78 int n2 = TOP_OTHER_REDEF2; // ok variable
|
| /external/guice/extensions/mini/test/com/google/inject/mini/ |
| MiniGuiceTest.java | 180 assertSame(m.f1, m.n2.f1);
181 assertSame(m.f1, m.n2.f2);
183 assertSame(m.f1, m.n2.fProvider.get());
188 @Inject N n2; field in class:MiniGuiceTest.M
|
| /external/icu/icu4c/source/test/intltest/ |
| tstnorm.h | 91 void checkLowMappingToEmpty(const Normalizer2 &n2);
|
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 36 for (int n2 = f; n2 < f+1; ++n2, ++i)
37 assert(*i == t2[n2]);
|
| splice_after_range.pass.cpp | 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldAndroidPipedStreamTest.java | 273 int n2; field in class:OldAndroidPipedStreamTest.Fibonacci
280 n2 = 0;
284 int ret = n1 + n2;
285 n2 = n1;
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 36 for (int n2 = f; n2 < f+1; ++n2, ++i)
37 assert(*i == t2[n2]);
|
| splice_after_range.pass.cpp | 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
|
