HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 76 - 100 of 365) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/eigen/test/
product_large.cpp 48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local
50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
geo_hyperplane.cpp 34 VectorType n1 = VectorType::Random(dim).normalized(); local
37 HyperplaneType pl1(n1, p1);
43 VERIFY_IS_APPROX( n1.dot(n1), Scalar(1) );
46 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );
  /external/mesa3d/src/mesa/program/
register_allocate.h 60 unsigned int n1, unsigned int n2);
prog_noise.c 220 float n0, n1; local
229 n1 = t1 * t1 * grad1(perm[i1 & 0xff], x1);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
299 n1 = 0.0f;
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1);
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
441 n1 = 0.0f;
444 n1
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
    [all...]
register_allocate.c 296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
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);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/
arithmetic_op.hpp 46 template< typename T, T n1, T n2 >
49 BOOST_STATIC_CONSTANT(T, value = (n1 AUX778076_OP_TOKEN n2));
58 template< typename N1, typename N2 > struct apply
62 typename N1::value_type
65 , ( BOOST_MPL_AUX_VALUE_WKND(N1)::value
72 typename N1::value_type
75 , N1::value
  /system/core/include/utils/
Unicode.h 43 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
46 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
  /external/libvorbis/lib/
block.c 746 int n1=ci->blocksizes[1]>>(hs+1); local
757 thisCenter=n1;
761 prevCenter=n1;
776 for(i=0;i<n1;i++)
777 pcm[i]=pcm[i]*w[n1-i-1] + p[i]*w[i];
781 float *pcm=v->pcm[j]+prevCenter+n1/2-n0/2;
791 float *p=vb->pcm[j]+n1/2-n0/2;
794 for(;i<n1/2+n0/2;i++)
818 v->centerW=n1;
940 int n1=ci->blocksizes[1]>>(hs+1) local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
prog_noise.c 220 float n0, n1; local
229 n1 = t1 * t1 * grad1(perm[i1 & 0xff], x1);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
299 n1 = 0.0f;
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1);
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
441 n1 = 0.0f;
444 n1
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
    [all...]
register_allocate.c 296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
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);
  /external/v8/src/
scopes.cc 790 int n1 = n0 + 2; // indentation local
813 Indent(n1, "// (local) function name: ");
820 Indent(n1, "// scope has trivial outer context\n");
826 Indent(n1, "// strict mode scope\n");
829 Indent(n1, "// extended mode scope\n");
832 if (scope_inside_with_) Indent(n1, "// scope inside 'with'\n");
833 if (scope_contains_with_) Indent(n1, "// scope contains 'with'\n");
834 if (scope_calls_eval_) Indent(n1, "// scope calls 'eval'\n");
836 Indent(n1, "// outer scope calls 'eval' in non-strict context\n");
838 if (inner_scope_calls_eval_) Indent(n1, "// inner scope calls 'eval'\n")
    [all...]
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1withDSA_SignatureTest.java 486 int n1 = sig[offset + 3];
487 int n2 = sig[offset + n1 + 5];
489 if (sig[offset] != 0x30 || sig[offset + 1] != (n1 + n2 + 4)
490 || sig[offset + 2] != 2 || sig[offset + n1 + 4] != 2 || n1 > 21
494 return (n1 + n2 + 6);
535 int n1;
539 n1 = signingSigns[i].sign(sig, offset, 50);
546 if (n1 != n2) {
547 fail("incorrect signature's length : n1=" + n1 + " n2=
    [all...]
  /external/clang/test/SemaCXX/
cxx1y-variable-templates_top_level.cpp 373 namespace n1 { namespace in namespace:nested
388 using namespace n1;
393 // expected-error@-2 {{explicit instantiation of 'pi1a<float>' not in a namespace enclosing 'n1'}}
402 int i1 = n1::pi1b<int>;
404 template float n1::pi1b<float>;
406 // expected-error@-2 {{explicit instantiation of 'pi1b<float>' not in a namespace enclosing 'n1'}}
408 float f1 = n1::pi1b<float>;
410 template<> double n1::pi1b<double> = 5.2; // expected-error {{cannot define or redeclare 'pi1b' here because namespace 'use_n1b' does not enclose namespace 'n1'}} \
411 // expected-error {{variable template specialization of 'pi1b' must originally be declared in namespace 'n1'}}
    [all...]
  /cts/tools/dasm/src/dasm/
parser.cup 697 Insn:i Word:n1 Num:n2
698 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.number_val); :}
701 Insn:i Word:n1 Int:n2
702 {: dAsm.addOpcode(i.str_val, n1.str_val, new Integer(n2.int_val)); :}
705 Insn:i Word:n1 Word:n2
706 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val); :}
709 Insn:i Word:n1 Relative:n2
710 {: dAsm.addRelativeGoto(i.str_val, n1.str_val, n2.int_val); :}
713 Insn:i Word:n1 Word:n2 Word:n3
714 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val, n3.str_val); :
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 187 NodeData &n1 = getHeuristicNodeData(n1Itr), local
190 if (n1.isHeuristic)
217 NodeData &n1 = getHeuristicNodeData(n1Itr), local
222 if (!n1.isHeuristic && !n2.isHeuristic)
229 if (n1.isHeuristic) {
230 bool n1WasAllocable = n1.isAllocable;
233 if (n1WasAllocable && !n1.isAllocable) {
234 rnAllocableList.erase(n1.rnaItr);
235 n1.rnuItr =
  /external/chromium_org/chrome/browser/bookmarks/
bookmark_utils_unittest.cc 32 const BookmarkNode* n1 = model.AddURL(model.other_node(), local
47 EXPECT_TRUE(nodes[0] == n1);
48 EXPECT_TRUE(DoesBookmarkContainText(n1, ASCIIToUTF16("foo"), string()));
61 EXPECT_TRUE(nodes[0] == n1);
62 EXPECT_TRUE(DoesBookmarkContainText(n1, ASCIIToUTF16("foo bar"), string()));
  /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 );
  /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/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...]
  /external/chromium_org/v8/src/
scopes.cc 855 int n1 = n0 + 2; // indentation local
878 Indent(n1, "// (local) function name: ");
885 Indent(n1, "// scope has trivial outer context\n");
891 Indent(n1, "// strict mode scope\n");
894 Indent(n1, "// extended mode scope\n");
897 if (scope_inside_with_) Indent(n1, "// scope inside 'with'\n");
898 if (scope_contains_with_) Indent(n1, "// scope contains 'with'\n");
899 if (scope_calls_eval_) Indent(n1, "// scope calls 'eval'\n");
901 Indent(n1, "// outer scope calls 'eval' in non-strict context\n");
903 if (inner_scope_calls_eval_) Indent(n1, "// inner scope calls 'eval'\n")
    [all...]
  /external/chromium_org/chrome/browser/notifications/sync_notifier/
chrome_notifier_service_unittest.cc 320 scoped_ptr<SyncedNotification> n1(CreateNotification(
322 notifier.AddForTest(n1.Pass());
367 scoped_ptr<SyncedNotification> n1(CreateNotification(
369 notifier.AddForTest(n1.Pass());
418 scoped_ptr<SyncedNotification> n1(CreateNotification(
420 notifier.AddForTest(n1.Pass());
482 scoped_ptr<SyncedNotification> n1(CreateNotification(
484 notifier.AddForTest(n1.Pass());
527 scoped_ptr<SyncedNotification> n1(CreateNotification(
529 notifier.AddForTest(n1.Pass())
    [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/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/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);

Completed in 993 milliseconds

1 2 34 5 6 7 8 91011>>