/external/dbus/dbus/ |
dbus-sysdeps-wince-glue.c | 68 DWORD n1; local 85 n1 = ((nbytes + sizeof(wchar_t) - 1) / sizeof (wchar_t)) + 1; 86 result_w = malloc (n1 * sizeof (wchar_t)); 99 result_w[n1 - 1] = 0; /* Make sure it is really a string. */ 141 DWORD n1, nbytes, type; local 178 n1 = nbytes + 1; 179 result = malloc (n1); 182 if (RegQueryValueExA (key_handle, name, 0, &type, result, &n1))
|
/external/valgrind/unittest/ |
posix_tests.cc | 545 StealthNotification n1; 667 StealthNotification n1, n2, n3, n4, n5; 675 n1.signal(); 683 n1.wait(); 698 n1.wait(); 1063 StealthNotification n1, n2; 1069 n1.signal(); 1079 n1.wait();
|
/external/icu4c/test/cintltst/ |
putiltst.c | 34 double n1=0.0, y1=0.0, expn1, expy1; local 40 y1 = uprv_modf(value1, &n1); 43 if(y1 != expy1 || n1 != expn1){ 45 expn1, n1, expy1, y1); 48 log_verbose("[float] x = %f n = %f y = %f\n", value1, n1, y1);
|
/external/opencv/ml/src/ |
mlboost.cpp | 213 int n1 = node->get_num_valid(vi); local 215 assert( 0 <= split_point && split_point < n1-1 ); 226 for( ; i < n1; i++ ) 251 int n1 = node->get_num_valid(vi); local 260 for( i = n1; i < n; i++ ) 275 for( i = 0; i < n1 - 1; i++ ) 300 for( i = 0; i < n1 - 1; i++ ) 447 int n1 = node->get_num_valid(vi); local 453 for( i = n1; i < n; i++ ) 462 for( i = 0; i < n1 - 1; i++ 577 int n1 = node->get_num_valid(vi); local [all...] |
mltree.cpp | 1479 int n1 = node->get_num_valid(vi); local 1572 int n1 = node->get_num_valid(vi); local 2053 int n1 = node->get_num_valid(vi); local 2472 int n1 = node->get_num_valid(vi); local 2554 int n1 = node->get_num_valid(vi); local 2601 int n1 = node->get_num_valid(vi), nr1 = 0; local [all...] |
/external/qemu/block/ |
qcow2.c | 317 int n1; local 321 n1 = 0; 323 n1 = bs->total_sectors - sector_num; 324 memset(buf + n1 * 512, 0, 512 * (nb_sectors - n1)); 325 return n1; 387 int index_in_cluster, n1; local 429 n1 = qcow2_backing_read1(bs->backing_hd, acb->sector_num, 431 if (n1 > 0) { [all...] |
/external/chromium/testing/gtest/test/ |
gtest_output_test_.cc | 244 // waits for n1 | SCOPED_TRACE("Trace B"); 246 // | notifies n1 264 Notification n1; member in struct:CheckPoints 274 check_points->n1.Notify(); 292 check_points.n1.WaitForNotification();
|
gtest_unittest.cc | 2299 const int n1 = 1; local 2317 const int n1 = 1; local 2334 int n1 = 0; local 2346 n1++, n2++, n3++, n4++, n5++) local [all...] |
/external/javassist/src/test/test/javassist/convert/ |
ArrayAccessReplaceTest.java | 409 Number n1, n2, n3, n4; local 420 n1 = ns[1]; 430 return n1;
|
/external/webkit/Tools/android/flex-2.5.4a/ |
misc.c | 637 void out_dec2( fmt, n1, n2 ) 639 int n1, n2; 641 printf( fmt, n1, n2 );
|
/frameworks/base/opengl/tests/hwc/ |
hwcCommit.cpp | 398 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) { 399 formats.push_back(hwcTestGraphicFormat[n1].desc); [all...] |
/external/gtest/test/ |
gtest_unittest.cc | 1710 const int n1 = 1; local 1728 const int n1 = 1; local 1745 int n1 = 0; local 1757 n1++, n2++, n3++, n4++, n5++) local [all...] |
/external/chromium/chrome/browser/bookmarks/ |
bookmark_utils.h | 144 // Returns true if |n1| was added more recently than |n2|. 145 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2);
|
bookmark_index_unittest.cc | 211 const BookmarkNode* n1 = model_->AddURL(model_->other_node(), 0, local 218 EXPECT_TRUE(matches[0].node == n1);
|
bookmark_model.cc | 102 bool operator() (const BookmarkNode* n1, const BookmarkNode* n2) { 103 if (n1->type() == n2->type()) { 106 return n1->GetTitle() < n2->GetTitle(); 108 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS; 111 return n1->is_folder();
|
/external/icu4c/test/intltest/ |
svccoll.cpp | 345 int32_t n1, n2, n3; local 395 n1 = checkAvailable("before registerFactory"); 400 assertTrue("count after > count before", n2 > n1); 464 assertTrue("count after unregister == count before register", n3 == n1);
|
/external/iptables/iptables/ |
iptables-apply | 150 read -n1 -t "${TIMEOUT:-15}" ret 2>&1 || :
|
/external/srec/srec/cfront/ |
sp_fft.c | 643 unsigned i, ii, n1; local 759 n1 = n >> 1; 760 for (i = 1; i < n1; i++) 772 data[n1] = last; /* now the Nyquist freq can be put in place */
|
/ndk/sources/host-tools/nawk-20071023/ |
lib.c | 71 void makefields(int n1, int n2) /* create $n1..$n2 inclusive */ 76 for (i = n1; i <= n2; i++) { 357 void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */ 362 for (i = n1; i <= n2; i++) {
|
/external/apache-harmony/archive/src/test/java/org/apache/harmony/archive/tests/java/util/jar/ |
AttributesTest.java | 233 Attributes.Name n1 = new Attributes.Name("name"), n2 = new Attributes.Name("Name"); local 234 assertEquals(n1, n2);
|
/external/openssl/crypto/objects/ |
o_names.c | 308 const OBJ_NAME * const *n1=n1_; local 311 return strcmp((*n1)->name,(*n2)->name);
|
/external/v8/test/mjsunit/regress/ |
regress-842.js | 36 var obj = { name: "n1" };
|
/external/qemu/ |
exec.c | 732 unsigned int n1; local 736 n1 = (long)tb1 & 3; 739 *ptb = tb1->page_next[n1]; 742 ptb = &tb1->page_next[n1]; 749 unsigned int n1; local 757 n1 = (long)tb1 & 3; 759 if (n1 == n && tb1 == tb) 761 if (n1 == 2) { 764 ptb = &tb1->jmp_next[n1]; 785 unsigned int h, n1; local 1300 unsigned int n1; local [all...] |
/external/protobuf/gtest/test/ |
gtest_unittest.cc | 2538 const int n1 = 1; local 2556 const int n1 = 1; local 2573 int n1 = 0; local 2585 n1++, n2++, n3++, n4++, n5++) local [all...] |
/hardware/broadcom/wlan/bcm4329/dhdutil/ |
dhdu.c | 166 "logstamp [<n1>] [<n2>] -- add a message to the log"}, 1031 int n1, n2; local 1033 n1 = (int)((unsigned char)*inptr++); 1035 if (!isxdigit(n1) || !isxdigit(n2)) { 1037 (isxdigit(n1) ? n2 : n1)); 1041 n1 = isdigit(n1) ? (n1 - '0') 1042 : ((islower(n1) ? (toupper(n1)) : n1) - 'A' + 10) [all...] |