| /external/bluetooth/glib/glib/ |
| gtestutils.h | 40 #define g_assert_cmpint(n1, cmp, n2) do { gint64 __n1 = (n1), __n2 = (n2); \
43 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
44 #define g_assert_cmpuint(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
47 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
48 #define g_assert_cmphex(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
51 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'x'); } while (0)
52 #define g_assert_cmpfloat(n1,cmp,n2) do { long double __n1 = (n1), __n2 = (n2);
[all...] |
| /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/aac/libSYS/include/ |
| genericStds.h | 175 #define C_ALLOC_MEM2(name,type,n1,n2) \
176 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); } \
178 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
187 #define C_AALLOC_MEM2(name,type,n1,n2) \
188 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
190 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
199 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
200 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s); } \
202 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
211 #define C_AALLOC_MEM2_L(name,type,n1,n2,s)
[all...] |
| /external/clang/test/FixIt/ |
| fixit-vexing-parse.cpp | 65 int n2, // expected-note {{change this ',' to a ';' to call 'F1'}} local
|
| /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 | 577 const Normalizer2 *n2; local
579 n2=Normalizer2Factory::getNFDInstance(*pErrorCode);
581 n2=Normalizer2Factory::getFCDInstance(*pErrorCode);
597 FilteredNormalizer2 fn2(*n2, *uni32);
599 n2=&fn2;
604 int32_t spanQCYes1=n2->spanQuickCheckYes(str1, *pErrorCode);
605 int32_t spanQCYes2=n2->spanQuickCheckYes(str2, *pErrorCode);
622 n2->normalizeSecondAndAppend(fcd1, unnormalized, *pErrorCode);
629 n2->normalizeSecondAndAppend(fcd2, unnormalized, *pErrorCode);
|
| normlzr.cpp | 140 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
143 FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
146 n2->normalize(source, *dest, status);
175 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
178 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
181 return n2->quickCheck(source, status);
192 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, status); local
195 return FilteredNormalizer2(*n2, *uniset_getUnicode32Instance(status)).
198 return n2->isNormalized(source, status);
226 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, errorCode) local
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 129 NodeEntry &n2 = getNode(ne.getNode2()); local
132 (n2.getCosts().getLength() == ne.getCosts().getCols()) &&
135 ne.setNode2AEItr(n2.addEdge(edgeItr));
339 NodeEntry &n2 = getNode(e.getNode2()); local
341 n2.removeEdge(e.getNode2AEItr());
373 unsigned n2 = std::distance(nodesBegin(), getEdgeNode2(edgeItr)); local
374 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
376 os << "\n" << n1 << " " << n2 << "\n"
427 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
428 return &*n1 < &*n2;
[all...] |
| /external/clang/test/CodeGenCXX/ |
| destructor-calls.cpp | 39 N n2; local
|
| /gdk/samples/PhotoEditor/jni/ |
| convolution.cpp | 78 uint8_t* n2 = reinterpret_cast<uint8_t*>(src - 1); local
86 int32_t red = n1[0] + n2[0] + n3[0] + n4[0] + n5[0] + n6[0] + n7[0] + n8[0];
87 int32_t green = n1[1] + n2[1] + n3[1] + n4[1] + n5[1] + n6[1] + n7[1] + n8[1];
88 int32_t blue = n1[2] + n2[2] + n3[2] + n4[2] + n5[2] + n6[2] + n7[2] + n8[2];
|
| /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/guava/guava-tests/test/com/google/common/base/ |
| ObjectsTest.java | 68 Long n2 = Objects.firstNonNull(null, n1); local
69 assertSame(n1, n2);
|
| /frameworks/native/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/srec/srec/cfront/ |
| sp_fft.c | 174 unsigned m, n, n2, i, j, i0, is, id, ii, ib; local
193 n2 = n << 1;
205 id = n2;
207 n2 = n2 >> 1;
226 is = 2 * id - n2;
272 unsigned m, n, n2, n4, i, j, ii, nt; local
286 n2 = n << 1;
289 n2 = n2 >> 1
588 unsigned n2; local
[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 | 189 &n2 = getHeuristicNodeData(n2Itr); local
193 if (n2.isHeuristic)
219 &n2 = getHeuristicNodeData(n2Itr); local
223 if (!n1.isHeuristic && !n2.isHeuristic)
242 if (n2.isHeuristic) {
243 bool n2WasAllocable = n2.isAllocable;
246 if (n2WasAllocable && !n2.isAllocable) {
247 rnAllocableList.erase(n2.rnaItr);
248 n2.rnuItr =
|
| /frameworks/av/media/libstagefright/codecs/aacdec/ |
| fft_rx4_long.cpp | 199 Int n2; local
231 n2 = FFT_RX4_LONG;
236 n1 = n2;
237 n2 >>= 2;
285 for (j = 1; j < n2; j++)
|
| fft_rx4_short.cpp | 197 Int n2; local
242 n2 = FFT_RX4_SHORT;
253 n1 = n2;
254 n2 >>= 2;
313 for (j = 1; j < n2; j++)
|
| /packages/apps/Email/src/org/apache/james/mime4j/field/address/ |
| Builder.java | 78 Node n2 = it.nextNode();
local
79 if (n2 instanceof ASTgroup_body) {
80 return new Group(name, buildGroupBody((ASTgroup_body)n2));
82 else if (n2 instanceof ASTangle_addr) {
84 return new NamedMailbox(name, buildAngleAddr((ASTangle_addr)n2));
|
