Searched defs:n2 (Results 1 - 25 of 203) sorted by relevance

123456789

/external/clang/test/SemaCXX/
H A Dpr18284-crash-on-invalid.cpp15 namespace n2 { namespace
24 } // namespace n2
/external/stlport/test/unit/
H A Dlexcmp_test.cpp35 char n2[size] = "shine"; local
37 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size);
44 char n2[size] = "shine"; local
46 bool before = lexicographical_compare(n1, n1 + size, n2, n2 + size, greater<char>());
H A Dmismatch_test.cpp41 int n2[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));
72 char const* n2[size]; local
73 copy(n1, n1 + 5, (char const**)n2);
74 pair <char const**, char const**> result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
76 CPPUNIT_ASSERT(result.first == n1 + size && result.second == n2 + size);
78 n2[2] = "QED";
79 result = mismatch((char const**)n1, (char const**)n1 + size, (char const**)n2, str_equal);
80 CPPUNIT_ASSERT(!(result.first == n2
[all...]
/external/clang/test/Sema/
H A Dattr-section.c14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
/external/libutf/
H A Dutfutf.c29 long f, n1, n2; local
37 n2 = strlen(s2);
39 if(strncmp(p, s2, n2) == 0)
/external/chromium_org/third_party/icu/source/common/unicode/
H A Dnormalizer2.h451 * @param n2 wrapped Normalizer2 instance
455 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) : argument
456 norm2(n2), set(filterSet) {}
/external/chromium_org/third_party/smhasher/src/
H A DStats.cpp77 double n2 = n * 1; local
79 if(n2 < 0) n2 = 0;
81 n2 *= 100;
83 if(n2 > 64) n2 = 64;
85 int n3 = (int)n2;
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-node.cc23 Node* n2 = graph.NewNode(&dummy_operator); local
24 CHECK(n2->id() != n1->id());
31 Node* n2 = graph.NewNode(&dummy_operator); local
33 CHECK(n2->op() == &dummy_operator);
40 Node* n2 = graph.NewNode(&dummy_operator, n0); local
41 CHECK_EQ(1, n2->InputCount());
42 CHECK(n0 == n2->InputAt(0));
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
51 CHECK_EQ(2, n2->InputCount());
52 CHECK(n0 == n2
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); local
122 Node* n2 = graph.NewNode(&dummy_operator); local
136 Node* n2 = graph.NewNode(&dummy_operator, n0); local
184 Node* n2 = graph.NewNode(&dummy_operator); local
241 Node* n2 = graph.NewNode(&dummy_operator, n0); local
257 Node* n2 = graph.NewNode(&dummy_operator, n0); local
288 Node* n2 = graph.NewNode(&dummy_operator, n0); local
303 Node* n2 = graph.NewNode(&dummy_operator, n0); local
346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
422 Node* n2 = graph.NewNode(&dummy_operator, n0); local
445 Node* n2 = graph.NewNode(&dummy_operator, n0); local
481 Node* n2 = graph.NewNode(&dummy_operator, n0); local
523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
545 Node* n2 = graph.NewNode(&dummy_operator, n0); local
580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local
612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local
656 Node* n2 = graph.NewNode(&dummy_operator); local
672 Node* n2 = graph.NewNode(&dummy_operator); local
687 Node* n2 = graph.NewNode(&dummy_operator); local
700 Node* n2 = graph.NewNode(&dummy_operator); local
713 Node* n2 = graph.NewNode(&dummy_operator); local
732 Node* n2 = graph.NewNode(&dummy_operator, n0); local
747 Node* n2 = graph.NewNode(&dummy_operator, n0); local
761 Node* n2 = graph.NewNode(&dummy_operator, n0); local
773 Node* n2 = graph.NewNode(&dummy_operator, n0); local
785 Node* n2 = graph.NewNode(&dummy_operator, n0); local
803 Node* n2; local
[all...]
H A Dtest-schedule.cc47 Node* n2 = graph.NewNode(&dummy_operator); local
48 CHECK_EQ(NULL, schedule.block(n2));
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp5.cpp4 alignas(1) alignas(2) int n2; // expected-error {{less than minimum alignment}} variable
H A Dp6.cpp6 alignas(8) int n2; // expected-note {{previous declaration}} variable
7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
/external/clang/test/CXX/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
H A Dp3-0x.cpp44 int n2 = f(0); member in namespace:std_example
/external/clang/test/FixIt/
H A Dfixit-vexing-parse.cpp84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
/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 * (n2
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/icu/icu4c/source/common/unicode/
H A Dnormalizer2.h451 * @param n2 wrapped Normalizer2 instance
455 FilteredNormalizer2(const Normalizer2 &n2, const UnicodeSet &filterSet) : argument
456 norm2(n2), set(filterSet) {}
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
24 test(S s, typename S::size_type pos, typename S::size_type n1, typename S::size_type n2, typename S::value_type c, S expected) argument
H A Diter_iter_size_char.pass.cpp25 test(S s, typename S::size_type pos1, typename S::size_type n1, typename S::size_type n2, argument
32 s.replace(first, last, n2, c);
35 typename S::size_type rlen = n2;
/external/openssl/crypto/rand/
H A Drandtest.c73 unsigned long n2[16]; local
87 for (i=0; i<16; i++) n2[i]=0;
97 n2[j&0x0f]++;
98 n2[(j>>4)&0x0f]++;
137 d+=n2[i]*n2[i];
147 d+=n2[i]*n2[i];
/external/chromium_org/chrome/browser/undo/
H A Dbookmark_undo_service_test.cc154 const BookmarkNode* n2 = model->AddURL(model->other_node(), local
167 EXPECT_EQ(model->other_node()->GetChild(1), n2);
172 EXPECT_EQ(model->other_node()->GetChild(0), n2);
187 const BookmarkNode* n2 = model->AddURL(model->other_node(), local
203 EXPECT_EQ(model->other_node()->GetChild(1), n2);
212 EXPECT_EQ(model->other_node()->GetChild(1), n2);
/external/clang/test/Modules/
H A Dmacros2.c75 int n2 = TOP_OTHER_REDEF2; // ok variable
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DNodeSorter.java118 * @param n2 Second node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
141 n2Num = ((Double) n2.m_key1Value).doubleValue();
146 n2Num = ((Double) n2.m_key2Value).doubleValue();
153 double n2Num = (double)n2.m_keyValue[kIndex];
161 XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
204 n2String = (CollationKey) n2.m_key1Value;
209 n2String = (CollationKey) n2.m_key2Value;
216 String n2String = (String)n2
126 compare( NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support) argument
[all...]
/external/chromium_org/chrome/android/javatests/src/org/chromium/chrome/browser/test/
H A DProviderBookmarkNodeTest.java107 private static boolean isSameHierarchyDownwards(BookmarkNode n1, BookmarkNode n2) { argument
108 if (n1 == null && n2 == null) return true;
109 if (n1 == null || n2 == null) return false;
110 if (!n1.equalContents(n2)) return false;
112 if (!isSameHierarchyDownwards(n1.children().get(i), n2.children().get(i))) return false;
/external/chromium_org/third_party/icu/source/samples/uciter8/
H A Duciter8.c46 UCharIterator *iter2, const char *n2) {
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
114 log_err("%s->move(start) failed\n", n2);
118 log_err("%s->hasNext() at the start returns FALSE\n", n2);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
136 log_err("%s->hasNext() at the end returns TRUE\n", n2);
45 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument
[all...]
/external/chromium_org/v8/src/compiler/
H A Dgraph.h35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
36 Node* nodes[] = {n1, n2};
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
40 Node* nodes[] = {n1, n2, n3};
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
44 Node* nodes[] = {n1, n2, n3, n4};
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
49 Node* nodes[] = {n1, n2, n3, n4, n5};
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
54 Node* nodes[] = {n1, n2, n
[all...]
H A Dvalue-numbering-reducer-unittest.cc42 Node* n2 = graph()->NewNode(&kOp0, nb); local
44 EXPECT_FALSE(Reduce(n2).Changed());
77 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); local
78 Reduction r2 = Reduce(n2);

Completed in 8445 milliseconds

123456789