Searched refs:n1 (Results 76 - 100 of 311) sorted by relevance

1234567891011>>

/external/clang/test/SemaCXX/
H A Dcxx1y-variable-templates_top_level.cpp389 namespace n1 { namespace in namespace:nested
404 using namespace n1;
409 // expected-error@-2 {{explicit instantiation of 'pi1a<float>' not in a namespace enclosing 'n1'}}
413 template<> double pi1a<double> = 5.2; // expected-error {{variable template specialization of 'pi1a' must originally be declared in namespace 'n1'}}
418 int i1 = n1::pi1b<int>;
420 template float n1::pi1b<float>;
422 // expected-error@-2 {{explicit instantiation of 'pi1b<float>' not in a namespace enclosing 'n1'}}
424 float f1 = n1::pi1b<float>;
426 template<> double n1::pi1b<double> = 5.2; // expected-error {{cannot define or redeclare 'pi1b' here because namespace 'use_n1b' does not enclose namespace 'n1'}} \
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dregister_allocate.c296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++;
336 unsigned int n1, unsigned int n2)
338 if (!g->nodes[n1].adjacency[n2]) {
339 ra_add_node_adjacency(g, n1, n2);
340 ra_add_node_adjacency(g, n2, n1);
335 ra_add_node_interference(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
/external/mesa3d/src/mesa/program/
H A Dregister_allocate.c296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
300 g->nodes[n1].adjacency_count++;
336 unsigned int n1, unsigned int n2)
338 if (!g->nodes[n1].adjacency[n2]) {
339 ra_add_node_adjacency(g, n1, n2);
340 ra_add_node_adjacency(g, n2, n1);
335 ra_add_node_interference(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DWNafUtil.java119 int n0 = (k0.intValue() + d0) & 7, n1 = (k1.intValue() + d1) & 7;
125 if ((n0 + u0) == 4 && (n1 & 3) == 2)
131 int u1 = n1 & 1;
134 u1 -= (n1 & 2);
135 if ((n1 + u1) == 4 && (n0 & 3) == 2)
/external/eigen/test/eigen2/
H A Deigen2_hyperplane.cpp33 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/
H A Dgeo_hyperplane.cpp33 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 );
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/mips/dspr2/
H A Dfilter_dspr2.c133 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] "
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/
H A Dfilter_dspr2.c133 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] "
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/
H A Dsanitizer_deadlock_detector_test.cc73 // 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/
H A Dvp9_entropy.c780 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
785 { n0, n1 + n2 },
786 { n1, n2 }
/external/chromium_org/third_party/sqlite/src/test/
H A Dlaststmtchanges.test221 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/clang/test/CodeGenCXX/
H A Ddebug-info-use-after-free.cpp276 n1 { namespace
287 n1::Test {
296 n1::C7 <
/external/libvpx/libvpx/vp9/common/
H A Dvp9_entropy.c752 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
757 { n0, n1 + n2 },
758 { n1, n2 }
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DTreeWizard.java350 int n1 = adaptor.getChildCount(t1);
352 if ( n1 != n2 ) {
355 for (int i=0; i<n1; i++) {
418 int n1 = adaptor.getChildCount(t1);
420 if ( n1 != n2 ) {
423 for (int i=0; i<n1; i++) {
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve8_avg_dspr2.c37 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] "
198 uint32_t n1, n2; local
[all...]
H A Dvp9_convolve8_avg_horiz_dspr2.c36 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],
[all...]
H A Dvp9_convolve8_horiz_dspr2.c36 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],
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dfts1_hash.c102 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument
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){ argument
119 if( n1!=n2 ) return 1;
120 return memcmp(pKey1,pKey2,n1);
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2_hash.c107 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument
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){ argument
124 if( n1!=n2 ) return 1;
125 return memcmp(pKey1,pKey2,n1);
/external/chromium_org/third_party/sqlite/src/ext/fts3/
H A Dfts3_hash.c107 static int fts3StrCompare(const void *pKey1, int n1, const void *pKey2, int n2){ argument
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){ argument
124 if( n1!=n2 ) return 1;
125 return memcmp(pKey1,pKey2,n1);
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/
H A Ddwarf2-dbgfmt.c313 dwarf2_loc *n1, *n2; local
316 n1 = STAILQ_FIRST(&dsd->locs);
317 while (n1) {
318 n2 = STAILQ_NEXT(n1, link);
319 yasm_xfree(n1);
320 n1 = n2;
/external/chromium_org/v8/src/
H A Dscopes.cc850 int n1 = n0 + 2; // indentation local
873 Indent(n1, "// (local) function name: ");
880 Indent(n1, "// scope has trivial outer context\n");
883 Indent(n1, "// strict mode scope\n");
885 if (scope_inside_with_) Indent(n1, "// scope inside 'with'\n");
886 if (scope_contains_with_) Indent(n1, "// scope contains 'with'\n");
887 if (scope_calls_eval_) Indent(n1, "// scope calls 'eval'\n");
889 Indent(n1, "// outer scope calls 'eval' in sloppy context\n");
891 if (inner_scope_calls_eval_) Indent(n1, "// inner scope calls 'eval'\n");
892 if (num_stack_slots_ > 0) { Indent(n1, "// ");
[all...]
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_convolve8_avg_dspr2.c37 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] "
198 uint32_t n1, n2; local
[all...]
H A Dvp9_convolve8_avg_horiz_dspr2.c36 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],
[all...]
H A Dvp9_convolve8_horiz_dspr2.c36 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],
[all...]

Completed in 6278 milliseconds

1234567891011>>