| /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...] |
| /system/extras/tests/binder/benchmarks/ |
| binderAddInts.cpp | 363 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
364 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
365 stream << (char) str[n1];
376 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
377 if (CPU_ISSET(n1, &set))
379 stream << n1; local
[all...] |
| /external/openssl/crypto/objects/ |
| obj_xref.c | 207 int n1, n2, n3; local
220 n1 = sigoid_srt[i][0];
221 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
223 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
224 n1=0;
225 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
227 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
| /frameworks/base/opengl/tests/hwc/ |
| hwcStress.cpp | 429 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++) {
430 unsigned int idx = testRandMod(selectedFrames[n1].size());
431 sp<GraphicBuffer> gBuf = selectedFrames[n1][idx];
432 hwc_layer_t *layer = &list->hwLayers[n1];
493 for (unsigned int n1 = 0; n1 < numSet; n1++) {
498 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++)
[all...] |
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
158 n1 = NULL;
175 if (n1 == NULL) {
176 n1 = n2;
181 n3->nbinary.ch1 = n1;
183 n1 = n3;
194 return n1;
200 return n1;
207 return n1;
212 return n1;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
[all...] |
| /frameworks/base/media/libstagefright/codecs/aacdec/ |
| fft_rx4_long.cpp | 198 Int n1; local
236 n1 = n2;
239 for (i = 0; i < FFT_RX4_LONG; i += n1)
242 pData2 = pData1 + n1;
250 pData3 = pData1 + (n1 >> 1);
251 pData4 = pData3 + n1;
293 for (i = j; i < FFT_RX4_LONG; i += n1)
296 pData2 = pData1 + n1;
304 pData3 = pData1 + (n1 >> 1);
305 pData4 = pData3 + n1;
[all...] |
| fft_rx4_short.cpp | 196 Int n1; local
253 n1 = n2;
255 n3 = n1 >> 1;
259 for (i = 0; i < FFT_RX4_SHORT; i += n1)
263 pData2 = pData1 + n1;
264 pData4 = pData3 + n1;
320 for (i = j; i < FFT_RX4_SHORT; i += n1)
324 pData2 = pData1 + n1;
325 pData4 = pData3 + n1;
|
| /external/tremolo/Tremolo/ |
| mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
| /external/openssl/crypto/bn/ |
| bn_div.c | 137 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
144 # define bn_div_words(n0,n1,d0) \
148 : "a"(n1), "d"(n0), "g"(d0) \
158 # define bn_div_words(n0,n1,d0) \
162 : "a"(n1), "d"(n0), "g"(d0) \
299 BN_ULONG n0,n1,rem=0; local
302 n1=wnump[-1];
311 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
313 q=bn_div_words(n0,n1,d0);
317 n0, n1, d0, q)
526 BN_ULONG n0,n1,rem=0; local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 117 * @param n1 First node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
140 n1Num = ((Double) n1.m_key1Value).doubleValue();
145 n1Num = ((Double) n1.m_key2Value).doubleValue();
152 double n1Num = (double)n1.m_keyValue[kIndex];
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
203 n1String = (CollationKey) n1.m_key1Value;
208 n1String = (CollationKey) n1.m_key2Value;
215 String n1String = (String)n1.m_keyValue[kIndex]
[all...] |
| /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.def/ |
| p8.cpp | 77 namespace redecl { inline namespace n1 { namespace in namespace:redecl
103 inline namespace n1 { namespace in namespace:redecl2
|
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldAndroidPipedStreamTest.java | 272 int n1 = -1; field in class:OldAndroidPipedStreamTest.Fibonacci
276 if (n1 < 0) {
277 n1 = 0;
279 } else if (n1 == 0) {
281 n1 = 1;
284 int ret = n1 + n2;
285 n2 = n1;
286 n1 = ret;
|
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_utils_unittest.cc | 23 const BookmarkNode* n1 = local
36 EXPECT_TRUE(nodes[0] == n1);
38 n1, ASCIIToUTF16("foo"), std::string()));
52 EXPECT_TRUE(nodes[0] == n1);
54 n1, ASCIIToUTF16("foo bar"), std::string()));
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSet.java | 749 * @param n1 First number to compare
754 abstract boolean compareNumbers(double n1, double n2);
782 * @param n1 First number to compare
785 * @return true if n1 is less than n2
787 boolean compareNumbers(double n1, double n2)
789 return n1 < n2;
818 * @param n1 First 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/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 128 NodeEntry &n1 = getNode(ne.getNode1()); local
131 assert((n1.getCosts().getLength() == ne.getCosts().getRows()) &&
134 ne.setNode1AEItr(n1.addEdge(edgeItr));
338 NodeEntry &n1 = getNode(e.getNode1()); local
340 n1.removeEdge(e.getNode1AEItr());
390 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
391 return &*n1 < &*n2;
394 bool operator()(Graph::ConstNodeItr n1, Graph::ConstNodeItr n2) const {
395 return &*n1 < &*n2;
|
| /libcore/luni/src/main/java/java/util/ |
| Grego.java | 126 long n1 = floorDivide(rem[0], 365, rem);
local
128 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
130 if (n100 == 4 || n1 == 4) {
|
| /external/clang/test/CodeGenCXX/ |
| destructor-calls.cpp | 38 N n1; local
|
| /system/core/rootdir/etc/ |
| init.testmenu | 6 n1=`cat /data/phoneentry1 2>/dev/null`
9 n1=${n1:-"*#06#"}
117 echo " 1: Dial: ATD $n1;"
131 "1" ) echo "Dialing $n1"; echo -e "ATD $n1;\r" >$atdev;;
134 "4" ) echo -n "Number: "; read n1; echo $n1 >/data/phoneentry1;;
|
| /external/opencv/cxcore/src/ |
| cxsvd.cpp | 247 int nm, m1, n1; local
263 n1 = n;
301 memset( temp, 0, n1 * sizeof( temp[0] ));
304 icvMatrAXPY_64f( m1, n1 - 1, a + 1, lda, hv, temp + 1, 0 );
305 for( k = 1; k < n1; k++ ) temp[k] *= h;
308 icvMatrAXPY_64f( m1, n1 - 1, temp + 1, 0, hv, a + 1, lda );
323 n1--;
327 if( n1 == 0 )
331 update_v = vT && n1 > n - nv;
335 for( j = 0; j < n1; j++
642 int nm, m1, n1; local
[all...] |
| /external/webkit/Tools/BuildSlaveSupport/gtk/crashmon/ |
| crashmon | 55 fullprogrampath=$(find "${programpath}" -executable -name "${programfile}"\* | head -n1)
|
| /frameworks/base/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/v8/src/ |
| scopes.cc | 593 int n1 = n0 + 2; // indentation local
616 Indent(n1, "// (local) function name: ");
623 Indent(n1, "// scope has trivial outer context\n");
625 if (scope_inside_with_) Indent(n1, "// scope inside 'with'\n");
626 if (scope_contains_with_) Indent(n1, "// scope contains 'with'\n");
627 if (scope_calls_eval_) Indent(n1, "// scope calls 'eval'\n");
628 if (outer_scope_calls_eval_) Indent(n1, "// outer scope calls 'eval'\n");
629 if (inner_scope_calls_eval_) Indent(n1, "// inner scope calls 'eval'\n");
631 Indent(n1, "// outer scope is 'eval' scope\n");
633 if (num_stack_slots_ > 0) { Indent(n1, "// ");
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
| SHA1withDSA_SignatureTest.java | 486 int n1 = sig[offset + 3];
487 int n2 = sig[offset + n1 + 5];
489 if (sig[offset] != 0x30 || sig[offset + 1] != (n1 + n2 + 4)
490 || sig[offset + 2] != 2 || sig[offset + n1 + 4] != 2 || n1 > 21
494 return (n1 + n2 + 6);
535 int n1;
539 n1 = signingSigns[i].sign(sig, offset, 50);
546 if (n1 != n2) {
547 fail("incorrect signature's length : n1=" + n1 + " n2=
[all...] |
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/serialization/ |
| SHA1PRNG_SecureRandomTest.java | 171 for ( int n1 = 0 ; n1 <= n ; n1++) {
173 b &= refTotalBytes[n1] == testTotalBytes[n1];
175 if ( j >= 20 || n1 == n ) {
177 " k=" +k + "n1 =" + n1, b);
|
| /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...] |
