HomeSort by relevance Sort by last modified time
    Searched defs:n1 (Results 101 - 125 of 446) sorted by null

1 2 3 45 6 7 8 91011>>

  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_avg_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
88 "preceu.ph.qbr %[n1], %[tp2] \n\t"
92 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
104 "preceu.ph.qbr %[n1], %[tn1] \n\t"
110 "dpa.w.ph $ac2, %[n1], %[vector4b] \n\t"
130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
157 uint32_t p1, p2, p3, p4, n1; local
196 "preceu.ph.qbl %[n1], %[tn2] \n\t"
213 "dpa.w.ph $ac1, %[n1], %[vector4b] \n\t
    [all...]
vp9_convolve8_dspr2.c 168 uint32_t p1, p2, p3, p4, n1; local
207 "preceu.ph.qbl %[n1], %[tp3] \n\t"
224 "dpa.w.ph $ac1, %[n1], %[vector4b] \n\t"
242 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
272 "preceu.ph.qbl %[n1], %[tp2] \n\t"
288 "dpa.w.ph $ac3, %[n1], %[vector4b] \n\t"
296 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
303 "lbux %[n1], %[Temp1](%[cm]) \n\t"
312 "sb %[n1], 0(%[odd_dst]) \n\t"
316 [n1] "=&r" (n1)
    [all...]
vp9_convolve8_horiz_dspr2.c 36 uint32_t n1, n2, n3, n4; local
85 "preceu.ph.qbr %[n1], %[tp2] \n\t"
89 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
99 "preceu.ph.qbr %[n1], %[tn1] \n\t"
103 "dpa.w.ph $ac2, %[n1], %[vector4b] \n\t"
119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
146 uint32_t p1, p2, p3, p4, n1; local
183 "preceu.ph.qbl %[n1], %[tn2] \n\t"
199 "dpa.w.ph $ac1, %[n1], %[vector4b] \n\t
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/javax/security/
OldSHA1PRNGSecureRandomTest.java 148 int n1 = 10; local
151 byte[][] bytes1 = new byte[10][n1];
162 int i1 = k / n1;
163 int i2 = k % n1;
  /libcore/ojluni/src/main/java/java/io/
BufferedReader.java 300 int n1 = read1(cbuf, off + n, len - n); local
301 if (n1 <= 0) break;
302 n += n1;
  /system/extras/tests/wifi/stress/
wifiLoadScanAssoc.c 390 unsigned int n1; local
403 for (n1 = 0; n1 < CPU_SETSIZE; n1++) {
404 if (CPU_ISSET(n1, &availCPU)) { numAvailCPU++; }
  /bionic/libc/upstream-openbsd/lib/libc/gdtoa/
misc.c 465 int i, k1, n, n1; local
471 n1 = n + b->wds + 1;
472 for(i = b->maxwds; n1 > i; i <<= 1)
492 ++n1;
502 ++n1;
508 b1->wds = n1 - 1;
  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
365 m=db_SafeReciprocal(sqrt(n1));
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
WNafUtil.java 135 int n0 = ((k0.intValue() >>> offset) + d0) & 7, n1 = ((k1.intValue() >>> offset) + d1) & 7; local
141 if ((n0 + u0) == 4 && (n1 & 3) == 2)
147 int u1 = n1 & 1;
150 u1 -= (n1 & 2);
151 if ((n1 + u1) == 4 && (n0 & 3) == 2)
  /external/clang/test/CodeGenCXX/
debug-info-use-after-free.cpp 276 n1 { namespace
287 n1::Test {
296 n1::C7 <
  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver.h 555 Scalar n0, n1; local
558 n1 = (c1 = representative.cross(mat.col((i0+2)%3))).squaredNorm();
559 if(n0>n1) res = c0/std::sqrt(n0);
560 else res = c1/std::sqrt(n1);
  /external/google-breakpad/src/testing/gtest/test/
gtest_output_test_.cc 244 // waits for n1 | SCOPED_TRACE("Trace B");
246 // | notifies n1
264 Notification n1; member in struct:CheckPoints
274 check_points->n1.Notify();
292 check_points.n1.WaitForNotification();
  /external/gtest/test/
gtest_output_test_.cc 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
  /external/guice/extensions/mini/test/com/google/inject/mini/
MiniGuiceTest.java 178 assertSame(m.f1, m.n1.f1);
179 assertSame(m.f1, m.n1.f2);
182 assertSame(m.f1, m.n1.fProvider.get());
187 @Inject N n1; field in class:MiniGuiceTest.M
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
CollationServiceTest.java 261 int n1 = checkAvailable("before registerFactory"); local
305 assertTrue("register increases count", n2>n1);
306 assertTrue("unregister restores count", n3==n1);
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
TestBagFormatter.java 77 double n1 = Double.parseDouble((String)o1); local
79 return n1 < n2 ? -1 : n1 > n2 ? 1 : 0;
  /external/icu/icu4c/source/test/cintltst/
putiltst.c 51 double n1=0.0, y1=0.0, expn1, expy1; local
57 y1 = uprv_modf(value1, &n1);
60 if(y1 != expy1 || n1 != expn1){
62 expn1, n1, expy1, y1);
65 log_verbose("[float] x = %f n = %f y = %f\n", value1, n1, y1);
  /external/icu/icu4c/source/test/intltest/
svccoll.cpp 346 int32_t n1, n2, n3; local
396 n1 = checkAvailable("before registerFactory");
401 assertTrue("count after > count before", n2 > n1);
468 assertTrue("count after unregister == count before register", n3 == n1);
  /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
CollationServiceTest.java 257 int n1 = checkAvailable("before registerFactory"); local
301 assertTrue("register increases count", n2>n1);
302 assertTrue("unregister restores count", n3==n1);
  /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
TestBagFormatter.java 76 double n1 = Double.parseDouble((String)o1); local
78 return n1 < n2 ? -1 : n1 > n2 ? 1 : 0;
  /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,
21 m0, n0, m1, n1, m2, n2, m3, n3);
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,
32 m0, n0, m1, n1, m2, n2, m3, n3);
35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8);
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7 local
548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
    [all...]
  /external/opencv3/modules/calib3d/src/
dls.h 163 int n1 = nn - 1; local
185 while (n1 >= low) {
188 int l = n1;
203 if (l == n1) {
204 H[n1][n1] = H[n1][n1] + exshift;
205 d[n1] = H[n1][n1]
    [all...]
  /external/v8/test/unittests/compiler/
graph-reducer-unittest.cc 507 Node* n1 = graph()->NewNode(&kOpA0); local
508 Node* n2 = graph()->NewNode(&kOpA1, n1);
509 Node* n3 = graph()->NewNode(&kOpA1, n1);
513 EXPECT_CALL(r1, Reduce(n1)).InSequence(s1, s2);
522 Node* n1 = graph()->NewNode(&kOpA0); local
523 Node* end = graph()->NewNode(&kOpA1, n1);
532 EXPECT_EQ(&kOpB0, n1->op());
534 EXPECT_EQ(n1, end->InputAt(0));
540 Node* n1 = graph()->NewNode(&kOpA0); local
541 Node* n2 = graph()->NewNode(&kOpA1, n1);
565 Node* n1 = graph()->NewNode(&kOpA0); local
631 Node* n1 = nend->InputAt(0); local
640 Node* n1 = graph()->NewNode(&kOpA0); local
658 Node* n1 = graph()->NewNode(&kOpA0); local
684 Node* n1 = graph()->NewNode(&kOpA0); local
705 Node* n1 = graph()->NewNode(&kOpA0); local
734 Node* n1 = graph()->NewNode(&kOpA0); local
814 Node* n1 = end->InputAt(0); local
835 Node* n1 = graph()->NewNode(&kOpA0); local
    [all...]
  /external/vulkan-validation-layers/tests/gtest-1.7.0/test/
gtest_output_test_.cc 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/
AttributesTest.java 209 Attributes.Name n1 = new Attributes.Name("name"), n2 = new Attributes.Name("Name"); local
210 assertEquals(n1, n2);

Completed in 4232 milliseconds

1 2 3 45 6 7 8 91011>>