| /external/elfutils/libelf/ |
| elf32_fsize.c | 93 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 92 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/icu4c/samples/uciter8/ |
| uciter8.c | 46 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);
[all...] |
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
160 n2 = andor();
163 if (n2->type == NCMD || n2->type == NPIPE) {
164 n2->ncmd.backgnd = 1;
165 } else if (n2->type == NREDIR) {
166 n2->type = NBACKGND;
170 n3->nredir.n = n2;
172 n2 = n3;
176 n1 = n2;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
533 union node *n = NULL, *n2; local
[all...] |
| /ndk/sources/host-tools/toolbox/ |
| cmp_win.c | 70 int n1, n2, ret = 0; local
73 n2 = fread(buf2, 1, BUFSIZE, f2);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
|
| /libcore/luni/src/main/java/org/apache/harmony/security/provider/crypto/ |
| SHA1withDSA_SignatureImpl.java | 201 int n, n1, n2; local
250 n2 = sBytes.length;
252 n2++;
255 signature = new byte[6 + n1 + n2]; // 48 is max. possible length of signature
257 signature[1] = (byte) (4 + n1 + n2); // total length of two INTEGERs
261 signature[5 + n1] = (byte) n2; // length of s
270 if (n2 == sBytes.length) {
323 int n1, n2; local
332 n2 = sigBytes[offset + n1 + 5];
336 || sigBytes[offset + 1] != (n1 + n2 + 4) || n1 > 2
[all...] |
| /external/libvorbis/lib/ |
| mdct.c | 57 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/aac/libSYS/include/ |
| genericStds.h | 172 #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,s)
[all...] |
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 132 uint32_t n2 = 1000000 + cur_slew_; local
139 LinearTransform::reduce(&n2, &d1);
140 LinearTransform::reduce(&n2, &d2);
144 cur_trans_.a_to_b_numer = n1 * n2;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /external/openssl/crypto/objects/ |
| obj_xref.c | 210 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/ |
| NodeSorter.java | 118 * @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.m_keyValue[kIndex]
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSet.java | 750 * @param n2 Second number to compare
754 abstract boolean compareNumbers(double n1, double n2);
783 * @param n2 Second number to compare
785 * @return true if n1 is less than n2
787 boolean compareNumbers(double n1, double n2)
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)
825 return n1 <= n2;
[all...] |
| /external/icu4c/common/ |
| unormcmp.cpp | 538 UBool _normalize(const Normalizer2 *n2, const UChar *s, int32_t length,
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)) {
|
| normlzr.cpp | 139 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=Normalizer2Factory::getInstance(mode, errorCode) local
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 134 NodeEntry &n2 = getNode(ne.getNode2()); local
137 (n2.getCosts().getLength() == ne.getCosts().getCols()) &&
140 ne.setNode2AEItr(n2.addEdge(edgeItr));
344 NodeEntry &n2 = getNode(e.getNode2()); local
346 n2.removeEdge(e.getNode2AEItr());
378 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr)); local
379 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
381 os << "\n" << n1 << " " << n2 << "\n"
432 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
433 return &*n1 < &*n2;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| destructor-calls.cpp | 39 N n2; local
|
| /external/clang/test/FixIt/ |
| fixit-vexing-parse.cpp | 84 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 32 for (int n2 = f; n2 < f+1; ++n2, ++i)
33 assert(*i == t2[n2]);
|
| splice_after_range.pass.cpp | 33 for (int n2 = f; n2 < l-1; ++n2, ++i)
34 assert(*i == t2[n2]);
|
| /system/core/rootdir/etc/ |
| init.testmenu | 7 n2=`cat /data/phoneentry2 2>/dev/null`
10 n2=${n2:-"*#06#"}
118 echo " 2: Dial: ATD $n2;"
132 "2" ) echo "Dialing $n2"; echo -e "ATD $n2;\r" >$atdev;;
135 "5" ) echo -n "Number: "; read n2; echo $n2 >/data/phoneentry2;;
|
| /external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
| p6.cpp | 6 alignas(8) int n2; // expected-note {{previous declaration}} variable
7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
|
| /external/guava/guava-tests/test/com/google/common/base/ |
| ObjectsTest.java | 68 Long n2 = Objects.firstNonNull(null, n1); local
69 assertSame(n1, n2);
|
