| /external/icu4c/samples/uciter8/ |
| uciter8.c | 45 compareIterators(UCharIterator *iter1, const char *n1,
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
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));
104 log_err("%s->move(start) failed\n", n1);
108 log_err("%s->hasNext() at the start returns FALSE\n", n1);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
132 log_err("%s->hasNext() at the end returns TRUE\n", n1);
[all...] |
| /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 | 210 int n1, n2, n3; local
223 n1 = sigoid_srt[i][0];
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
227 n1=0;
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
| /frameworks/native/opengl/tests/hwc/ |
| hwcStress.cpp | 428 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++) {
429 unsigned int idx = testRandMod(selectedFrames[n1].size());
430 sp<GraphicBuffer> gBuf = selectedFrames[n1][idx];
431 hwc_layer_t *layer = &list->hwLayers[n1];
492 for (unsigned int n1 = 0; n1 < numSet; n1++) {
497 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/av/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/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) \
323 BN_ULONG n0,n1,rem=0; local
326 n1=wnump[-1];
335 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
337 q=bn_div_words(n0,n1,d0);
341 n0, n1, d0, q)
[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/guava/guava-tests/test/com/google/common/base/ |
| ObjectsTest.java | 67 Long n1 = new Long(42); local
68 Long n2 = Objects.firstNonNull(null, n1);
69 assertSame(n1, n2);
|
| /external/clang/test/FixIt/ |
| fixit-vexing-parse.cpp | 61 int n1(); // expected-warning {{function declaration}} expected-note {{replace parentheses with an initializer}}
|
| /external/tremolo/Tremolo/ |
| mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
| /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());
372 unsigned n1 = std::distance(nodesBegin(), getEdgeNode1(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...] |
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 131 uint32_t n1 = local_to_common_freq_numer_; local
137 // n1/d1 has already been reduced, no need to do so here.
138 LinearTransform::reduce(&n1, &d2);
144 cur_trans_.a_to_b_numer = 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/openssl/crypto/ec/ |
| ecp_smpl.c | 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
672 n1 = BN_CTX_get(ctx);
685 /* n1, n2 */
688 if (!BN_copy(n1, &a->X)) goto end;
690 /* n1 = X_a */
696 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end;
697 /* n1 = X_a * Z_b^2 */
724 if (!BN_mod_sub_quick(n5, n1, n3, p)) goto end;
726 /* n5 = n1 - n3 */
750 if (!BN_mod_add_quick(n1, n1, n3, p)) goto end
813 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /external/clang/test/CodeGenCXX/ |
| destructor-calls.cpp | 38 N n1; local
|
| /gdk/samples/PhotoEditor/jni/ |
| convolution.cpp | 77 uint8_t* n1 = reinterpret_cast<uint8_t*>(src_prev - 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 | 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;;
|
