Searched refs:n2 (Results 26 - 50 of 276) sorted by relevance

1234567891011>>

/external/llvm/unittests/IR/
H A DMetadataTest.cpp92 MDNode *n2 = MDNode::get(Context, c1); local
93 Value *const c2 = n2;
98 EXPECT_NE(n1, n2);
105 EXPECT_EQ(n5, n2);
113 EXPECT_EQ(1u, n2->getNumOperands());
114 EXPECT_EQ(n1, n2->getOperand(0));
138 MDNode *n2 = MDNode::get(Context, V2); local
144 NMD->addOperand(n2);
/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/icu/icu4c/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/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
H A Dsplice_after_flist.pass.cpp34 for (int n2 = 0; n2 < l; ++n2, ++i)
35 assert(*i == t2[n2]);
/external/chromium_org/v8/test/mjsunit/tools/
H A Dprofile_view.js84 view.sort(function(n1, n2) {
85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
86 (n1.selfTime - n2.selfTime);
/external/libvorbis/lib/
H A Dmdct.c57 int n2=n>>1; local
68 T[n2+i*2]=FLOAT_CONV(cos((M_PI/(2*n))*(2*i+1)));
69 T[n2+i*2+1]=FLOAT_CONV(sin((M_PI/(2*n))*(2*i+1)));
399 int n2=n>>1; local
404 DATA_TYPE *iX = in+n2-7;
405 DATA_TYPE *oX = out+n2+n4;
418 iX = in+n2-8;
419 oX = out+n2+n4;
432 mdct_butterflies(init,out+n2,n2);
495 int n2=n>>1; local
[all...]
/external/chromium_org/v8/src/compiler/
H A Dgraph-builder.h33 Node* NewNode(const Operator* op, Node* n1, Node* n2) { argument
34 Node* buffer[] = {n1, n2};
38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { argument
39 Node* buffer[] = {n1, n2, n3};
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
44 Node* buffer[] = {n1, n2, n3, n4};
48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
50 Node* buffer[] = {n1, n2, n3, n4, n5};
54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
56 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);
/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;
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);
351 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
352 unsigned int n2_class = g->nodes[n2].class;
354 if (n != n2
335 ra_add_node_interference(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
427 unsigned int n2 = g->nodes[n].adjacency_list[i]; local
516 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
[all...]
/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;
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);
351 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
352 unsigned int n2_class = g->nodes[n2].class;
354 if (n != n2
335 ra_add_node_interference(struct ra_graph *g, unsigned int n1, unsigned int n2) argument
427 unsigned int n2 = g->nodes[n].adjacency_list[i]; local
516 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
[all...]
/external/aac/libSYS/include/
H A DgenericStds.h172 #define C_ALLOC_MEM2(name,type,n1,n2) \
173 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); } \
175 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
184 #define C_AALLOC_MEM2(name,type,n1,n2) \
185 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
187 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
196 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
197 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s); } \
199 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
208 #define C_AALLOC_MEM2_L(name,type,n1,n2,
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dax25.h89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
/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/openssl/crypto/objects/
H A Dobj_xref.c210 int n1, n2, n3; local
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
/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/apache-xml/src/main/java/org/apache/xpath/objects/
H A DXNodeSet.java750 * @param n2 Second number to compare
754 abstract boolean compareNumbers(double n1, double n2); argument
783 * @param n2 Second number to compare
785 * @return true if n1 is less than n2
787 boolean compareNumbers(double n1, double n2) argument
789 return n1 < n2;
819 * @param n2 Second number to compare
821 * @return true if n1 is less than or equal to n2
823 boolean compareNumbers(double n1, double n2) argument
825 return n1 <= n2;
859 compareNumbers(double n1, double n2) argument
895 compareNumbers(double n1, double n2) argument
930 compareNumbers(double n1, double n2) argument
965 compareNumbers(double n1, double n2) argument
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dtest-graph-reducer.cc218 Node* n2 = graph.NewNode(&OPA1, n1); local
220 Node* end = graph.NewNode(&OPA2, n2, n3);
228 recorder.CheckContains(n2);
261 Node* n2 = graph.NewNode(&OPA1, n1); local
263 Node* end = graph.NewNode(&OPA2, n2, n3);
276 CHECK_EQ(&OPB1, n2->op());
277 CHECK_EQ(n1, n2->InputAt(0));
281 CHECK_EQ(n2, end->InputAt(0));
291 Node* n2 = graph.NewNode(&OPA1, n1); local
293 Node* end = graph.NewNode(&OPA2, n2, n
401 Node* n2 = graph.NewNode(&OPA1, n1); local
456 Node* n2 = graph.NewNode(&OPA1, n1); local
491 Node* n2 = graph.NewNode(&OPA1, n1); local
576 Node* n2 = end->InputAt(1); local
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dunormcmp.cpp538 UBool _normalize(const Normalizer2 *n2, const UChar *s, int32_t length, argument
543 int32_t spanQCYes=n2->spanQuickCheckYes(str, *pErrorCode);
558 n2->normalizeSecondAndAppend(normalized, unnormalized, *pErrorCode);
606 const Normalizer2 *n2; local
608 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
610 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
618 FilteredNormalizer2 fn2(*n2, *uni32);
628 if(_normalize(n2, s1, length1, fcd1, pErrorCode)) {
632 if(_normalize(n2, s2, length2, fcd2, pErrorCode)) {
H A Dnormlzr.cpp139 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
142 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
145 n2->normalize(source, *dest, status);
174 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
177 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
180 return n2->quickCheck(source, status);
191 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
194 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
197 return n2->isNormalized(source, status);
225 const Normalizer2 *n2 local
[all...]
/external/chromium_org/ui/message_center/
H A Dnotification_list.cc35 Notification* n2) {
36 if (n1->priority() > n2->priority()) // Higher pri go first.
38 if (n1->priority() < n2->priority())
40 return CompareTimestampSerial()(n1, n2);
43 bool CompareTimestampSerial::operator()(Notification* n1, Notification* n2) { argument
44 if (n1->timestamp() > n2->timestamp()) // Newer come first.
46 if (n1->timestamp() < n2->timestamp())
48 if (n1->serial_number() > n2->serial_number()) // Newer come first.
50 if (n1->serial_number() < n2->serial_number())
34 operator ()(Notification* n1, Notification* n2) argument
/external/icu/icu4c/source/common/
H A Dunormcmp.cpp538 UBool _normalize(const Normalizer2 *n2, const UChar *s, int32_t length, argument
543 int32_t spanQCYes=n2->spanQuickCheckYes(str, *pErrorCode);
558 n2->normalizeSecondAndAppend(normalized, unnormalized, *pErrorCode);
606 const Normalizer2 *n2; local
608 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
610 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
618 FilteredNormalizer2 fn2(*n2, *uni32);
628 if(_normalize(n2, s1, length1, fcd1, pErrorCode)) {
632 if(_normalize(n2, s2, length2, fcd2, pErrorCode)) {
H A Dnormlzr.cpp139 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
142 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
145 n2->normalize(source, *dest, status);
174 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
177 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
180 return n2->quickCheck(source, status);
191 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
194 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
197 return n2->isNormalized(source, status);
225 const Normalizer2 *n2 local
[all...]
/external/chromium_org/components/enhanced_bookmarks/
H A Denhanced_bookmark_utils.cc48 // Returns true if |n1| preceeds |n2|.
49 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) { argument
51 DCHECK(!n2->is_folder());
53 return n1->GetTitle() < n2->GetTitle();
55 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
/external/clang/test/CodeGenCXX/
H A Ddestructor-calls.cpp39 N n2; local
/external/clang/test/FixIt/
H A Dfixit-vexing-parse.cpp84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local

Completed in 2384 milliseconds

1234567891011>>