Searched defs:n1 (Results 1 - 25 of 221) sorted by relevance

123456789

/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp4 namespace n1 { namespace
13 } // namespace n1
/external/stlport/test/unit/
H A Dlexcmp_test.cpp34 char n1[size] = "shoe"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
43 char n1[size] = "shoe"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
H A Dmismatch_test.cpp40 int n1[5] = { 1, 2, 3, 4, 5 }; local
44 pair <int*, int*> result = mismatch((int*)n1, (int*)n1 + 5, (int*)n2);
45 CPPUNIT_ASSERT(result.first ==(n1 + 5) && result.second ==(n2 + 5));
47 result = mismatch((int*)n1, (int*)n1 + 5, (int*)n3);
48 CPPUNIT_ASSERT(!(result.first ==(n1 + 5) && result.second ==(n3 + 5)));
49 CPPUNIT_ASSERT((result.first - n1)==3);
70 char const* n1[size] = { "Brett", "Graham", "Jack", "Mike", "Todd" }; local
73 copy(n1, n
[all...]
/external/clang/test/CodeGen/
H A D2002-09-18-UnionProblem.c13 short __udivmodhi4 (char n1, char bm) { argument
18 rr.s.high = n1;
/external/clang/test/Sema/
H A Dattr-section.c13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute only applies to functions and global variables}} local
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
32 n1 = chartorune(&r, s2);
38 for(p=s1; (p=utfrune(p, f)) != 0; p+=n1)
/external/openssl/crypto/bn/asm/
H A Dia64-mont.pl365 n1=r24; n2=r25; n3=r26; n4=r27; n5=r28; n6=r29; n7=r30; n8=r31;
595 { .mii; (p16) getf.sig n1=nlo[1] // 19:
620 (p16) add a1=a1,n1 } // (p16) a1+=n1
630 { .mfi; (p16) cmp.ltu.unc p42,p40=a1,n1
666 { .mmi; (p0) getf.sig n1=ni0 // 0:
764 sub n1=t0,n1 };;
765 { .mmi; cmp.gtu p34,p32=n1,t0;;
810 { .mmi; (p32)st8 [rptr]=n1,
756 sub n1=t0,n1 };; subroutine
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node.cc22 Node* n1 = graph.NewNode(&dummy_operator); local
24 CHECK(n2->id() != n1->id());
30 Node* n1 = graph.NewNode(&dummy_operator); local
32 CHECK(n1->op() == &dummy_operator);
49 Node* n1 = graph.NewNode(&dummy_operator); local
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
53 CHECK(n1 == n2->InputAt(1));
60 Node* n1 = graph.NewNode(&dummy_operator); local
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1);
71 Node* n1 = graph.NewNode(&dummy_operator); local
84 Node* n1 = graph.NewNode(&dummy_operator, n0); local
95 Node* n1 = graph.NewNode(&dummy_operator); local
110 Node* n1 = graph.NewNode(&dummy_operator, n0); local
121 Node* n1 = graph.NewNode(&dummy_operator); local
135 Node* n1 = graph.NewNode(&dummy_operator, n0); local
161 Node* n1 = graph.NewNode(&dummy_operator, n0); local
183 Node* n1 = graph.NewNode(&dummy_operator); local
236 Node* n1 = graph.NewNode(&dummy_operator); local
254 Node* n1 = graph.NewNode(&dummy_operator, n0); local
284 Node* n1 = graph.NewNode(&dummy_operator, n0); local
302 Node* n1 = graph.NewNode(&dummy_operator, n0); local
345 Node* n1 = graph.NewNode(&dummy_operator, n0); local
366 Node* n1 = graph.NewNode(&dummy_operator, n0); local
403 Node* n1 = graph.NewNode(&dummy_operator, n0); local
421 Node* n1 = graph.NewNode(&dummy_operator, n0); local
444 Node* n1 = graph.NewNode(&dummy_operator, n0); local
480 Node* n1 = graph.NewNode(&dummy_operator, n0); local
485 n2->ReplaceUsesIf(FixedPredicate<true>(), n1); local
487 n2->ReplaceUsesIf(FixedPredicate<false>(), n1); local
491 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local
493 n3->ReplaceUsesIf(FixedPredicate<false>(), n1); local
498 n0->ReplaceUsesIf(FixedPredicate<false>(), n1); local
501 n0->ReplaceUsesIf(FixedPredicate<true>(), n1); local
509 n3->ReplaceUsesIf(FixedPredicate<true>(), n1); local
522 Node* n1 = graph.NewNode(&dummy_operator, n0); local
544 Node* n1 = graph.NewNode(&dummy_operator); local
562 Node* n1 = graph.NewNode(&dummy_operator, n0); local
571 Node* n1 = graph.NewNode(&dummy_operator, n0); local
579 Node* n1 = graph.NewNode(&dummy_operator); local
590 Node* n1 = graph.NewNode(&dummy_operator); local
601 Node* n1 = graph.NewNode(&dummy_operator); local
635 Node* n1 = graph.NewNode(&dummy_operator); local
645 Node* n1 = graph.NewNode(&dummy_operator); local
655 Node* n1 = graph.NewNode(&dummy_operator); local
671 Node* n1 = graph.NewNode(&dummy_operator); local
686 Node* n1 = graph.NewNode(&dummy_operator); local
731 Node* n1 = graph.NewNode(&dummy_operator); local
746 Node* n1 = graph.NewNode(&dummy_operator); local
760 Node* n1 = graph.NewNode(&dummy_operator); local
802 Node* n1 = graph.NewNode(&dummy_operator, n0); local
831 Node* n1 = graph.NewNode(&dummy_operator, n0); local
[all...]
H A Dtest-schedule.cc35 Node* n1 = graph.NewNode(&dummy_operator); local
41 schedule.AddNode(entry, n1);
44 CHECK_EQ(entry, schedule.block(n1));
45 CHECK(schedule.SameBasicBlock(n0, n1));
/external/chromium_org/v8/test/mjsunit/
H A Dobject-toprimitive.js34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp3 alignas(1) int n1; // expected-error {{requested alignment is less than minimum alignment of 4 for type 'int'}} variable
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp3-0x.cpp43 int n1 = f(i); member in namespace:std_example
/external/eigen/test/
H A Dproduct_large.cpp48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local
50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
/external/flac/include/share/
H A Dalloc.h29 // malloc(n1 * n2) then memset to zero
30 static inline void *safe_calloc_(size_t n1, size_t n2) argument
33 return calloc(n1, n2);
36 // malloc(n1 + n2)
37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) argument
39 unsigned long long n = n1 + n2;
45 // malloc(n1 * n2)
46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) argument
48 unsigned long long n = n1 * n2;
54 // malloc(n1 * (n
55 safe_malloc_muladd2_(size_t n1, size_t n2, size_t n3) argument
64 safe_realloc_mul_2op_(void *ptr, size_t n1, size_t n2) argument
[all...]
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
H A Dsplice_after_flist.pass.cpp31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
H A Dsplice_after_one.pass.cpp31 int n1 = 0; local
32 for (; n1 < p; ++n1, ++i)
33 assert(*i == t1[n1]);
36 for (; n1 < size_t1; ++n1, ++i)
37 assert(*i == t1[n1]);
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/
H A Diter_iter_pointer.pass.cpp25 test(S s, typename S::size_type pos1, typename S::size_type n1, const typename S::value_type* str, S expected) argument
29 typename S::const_iterator last = s.begin() + pos1 + n1;
H A Diter_iter_string.pass.cpp25 test(S s, typename S::size_type pos1, typename S::size_type n1, S str, S expected) argument
29 typename S::const_iterator last = s.begin() + pos1 + n1;
H A Dsize_size_pointer.pass.cpp13 // replace(size_type pos, size_type n1, const charT* s);
26 test(S s, typename S::size_type pos, typename S::size_type n1, argument
33 s.replace(pos, n1, str);
37 typename S::size_type xlen = std::min(n1, old_size - pos);
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
24 test(S s, typename S::size_type pos, typename S::size_type n1, argument
32 s.replace(pos, n1, n2, c);
36 typename S::size_type xlen = std::min(n1, old_size - pos);
H A Dsize_size_string.pass.cpp13 // replace(size_type pos1, size_type n1, const basic_string<charT,traits,Allocator>& str);
24 test(S s, typename S::size_type pos1, typename S::size_type n1, S str, S expected) argument
30 s.replace(pos1, n1, str);
34 typename S::size_type xlen = std::min(n1, old_size - pos1);
/external/libcxx/test/strings/basic.string/string.ops/string_compare/
H A Dsize_size_pointer.pass.cpp12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1, argument
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
H A Dsize_size_string.pass.cpp12 // int compare(size_type pos1, size_type n1, const basic_string& str) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1, argument
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
/external/openssl/crypto/rand/
H A Drandtest.c72 unsigned long n1; local
86 n1=0;
118 if (s) n1++;
126 if (!((9654 < n1) && (n1 < 10346)))
128 printf("test 1 failed, X=%lu\n",n1);
/external/chromium_org/chrome/browser/undo/
H A Dbookmark_undo_service_test.cc114 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
119 model->SetTitle(n1, ASCIIToUTF16("bar"));
120 model->SetURL(n1, GURL("http://www.bar.com"));
150 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
162 model->Move(n1, model->other_node(), 3);
166 EXPECT_EQ(model->other_node()->GetChild(0), n1);
174 EXPECT_EQ(model->other_node()->GetChild(2), n1);
183 const BookmarkNode* n1 = model->AddURL(model->other_node(), local
202 EXPECT_EQ(model->other_node()->GetChild(0), n1);
211 EXPECT_EQ(model->other_node()->GetChild(0), n1);
[all...]

Completed in 7010 milliseconds

123456789