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

1 2 3 45 6 7 8 91011>>

  /external/eigen/test/eigen2/
eigen2_hyperplane.cpp 33 VectorType n1 = VectorType::Random(dim).normalized(); local
36 HyperplaneType pl1(n1, p1);
42 VERIFY_IS_APPROX( n1.eigen2_dot(n1), Scalar(1) );
45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );
  /external/eigen/test/
geo_hyperplane.cpp 33 VectorType n1 = VectorType::Random(dim).normalized(); local
36 HyperplaneType pl1(n1, p1);
42 VERIFY_IS_APPROX( n1.dot(n1), Scalar(1) );
45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );
  /system/extras/tests/wifi/stress/
wifiLoadScanAssoc.c 389 unsigned int n1; local
402 for (n1 = 0; n1 < CPU_SETSIZE; n1++) {
403 if (CPU_ISSET(n1, &availCPU)) { numAvailCPU++; }
  /external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
195 "preceu.ph.qbr %[n1], %[tp2] \n\t"
199 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
205 "preceu.ph.qbl %[n1], %[tn2] \n\t"
209 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
271 "preceu.ph.qbr %[n1], %[tp2] \n\t"
275 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3)
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /external/libvpx/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
195 "preceu.ph.qbr %[n1], %[tp2] \n\t"
199 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
205 "preceu.ph.qbl %[n1], %[tn2] \n\t"
209 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
271 "preceu.ph.qbr %[n1], %[tp2] \n\t"
275 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3)
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
195 "preceu.ph.qbr %[n1], %[tp2] \n\t"
199 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
205 "preceu.ph.qbl %[n1], %[tn2] \n\t"
209 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
271 "preceu.ph.qbr %[n1], %[tp2] \n\t"
275 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3)
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 73 // Cycle: n1->n2->n1
77 uptr n1 = d.newNode(1); local
79 EXPECT_FALSE(d.onLock(&dtls, n1));
82 d.onUnlock(&dtls, n1);
85 EXPECT_EQ(0U, d.findPathToLock(&dtls, n1, path, 1));
86 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 10));
87 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 2));
88 EXPECT_TRUE(d.onLock(&dtls, n1));
89 EXPECT_EQ(path[0], n1);
101 uptr n1 = d.newNode(1); local
    [all...]
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/
vp9_entropy.c 780 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
    [all...]
  /external/chromium_org/third_party/sqlite/src/test/
laststmtchanges.test 221 create temp table n1 (k integer primary key, n);
232 insert into n1 values (NULL, changes());
234 insert into n1 values (NULL, changes());
236 insert into n1 values (NULL, changes());
239 insert into n1 values (NULL, changes());
271 select n from n1;
  /external/libvpx/libvpx/vp9/common/
vp9_entropy.c 752 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
757 { n0, n1 + n2 },
758 { n1, n2 }
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_entropy.c 752 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
757 { n0, n1 + n2 },
758 { n1, n2 }
    [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeWizard.java 350 int n1 = adaptor.getChildCount(t1); local
352 if ( n1 != n2 ) {
355 for (int i=0; i<n1; i++) {
418 int n1 = adaptor.getChildCount(t1); local
420 if ( n1 != n2 ) {
423 for (int i=0; i<n1; i++) {
  /external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_avg_dspr2.c 37 uint32_t n1, n2; local
78 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
87 "dpa.w.ph $ac1, %[n1], %[vector1b] \n\t"
92 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
101 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
115 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
125 "dpa.w.ph $ac1, %[n1], %[vector3b] \n\t"
131 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
147 "dpa.w.ph $ac3, %[n1], %[vector3b] \n\t"
167 [p1] "=&r" (p1), [p2] "=&r" (p2), [n1] "=&r" (n1), [n2] "=&r" (n2)
198 uint32_t n1, n2; local
    [all...]
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_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...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
fts1_hash.c 102 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
103 if( n1!=n2 ) return 1;
104 return strncmp((const char*)pKey1,(const char*)pKey2,n1);
118 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
119 if( n1!=n2 ) return 1;
120 return memcmp(pKey1,pKey2,n1);
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2_hash.c 107 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
108 if( n1!=n2 ) return 1;
109 return strncmp((const char*)pKey1,(const char*)pKey2,n1);
123 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
124 if( n1!=n2 ) return 1;
125 return memcmp(pKey1,pKey2,n1);
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_hash.c 107 static int fts3StrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
108 if( n1!=n2 ) return 1;
109 return strncmp((const char*)pKey1,(const char*)pKey2,n1);
123 static int fts3BinCompare(const void *pKey1, int n1, const void *pKey2, int n2){
124 if( n1!=n2 ) return 1;
125 return memcmp(pKey1,pKey2,n1);