| /external/icu4c/test/cintltst/ |
| putiltst.c | 51 double n1=0.0, y1=0.0, expn1, expy1; local
57 y1 = uprv_modf(value1, &n1);
60 if(y1 != expy1 || n1 != expn1){
62 expn1, n1, expy1, y1);
65 log_verbose("[float] x = %f n = %f y = %f\n", value1, n1, y1);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_minidom.py | [all...] |
| /system/core/fs_mgr/ |
| fs_mgr.c | 555 char *n1; local
559 n1 = strdup(in1);
562 remove_trailing_slashes(n1);
565 ret = !strcmp(n1, n2);
567 free(n1);
|
| /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();
|
| /external/chromium_org/testing/gtest/test/ |
| gtest_output_test_.cc | 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
|
| /external/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();
|
| /external/javassist/src/test/test/javassist/convert/ |
| ArrayAccessReplaceTest.java | 409 Number n1, n2, n3, n4; local
420 n1 = ns[1];
430 return n1;
|
| /external/libvpx/libvpx/third_party/googletest/src/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();
|
| /frameworks/native/opengl/tests/hwc/ |
| hwcCommit.cpp | 397 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
398 formats.push_back(hwcTestGraphicFormat[n1].desc);
[all...] |
| /ndk/sources/third_party/googletest/googletest/test/ |
| gtest_output_test_.cc | 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
|
| /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);
|
| /external/chromium_org/third_party/icu/source/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/clang/test/CXX/expr/expr.const/ |
| p2-0x.cpp | 14 int n1[this->this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
228 constexpr int n1 = 2 * 3 * 3 * 7 * 11 * 31 * 151 * 331; // ok member in namespace:UndefinedBehavior::Overflow
230 constexpr int n3 = n1 + 1; // ok
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_kissfft_impl.h | 282 void fwd2( Complex * dst,const Complex *src,int n0,int n1)
287 EIGEN_UNUSED_VARIABLE(n1);
291 void inv2( Complex * dst,const Complex *src,int n0,int n1)
296 EIGEN_UNUSED_VARIABLE(n1);
|
| /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/chromium_org/chrome/browser/bookmarks/ |
| bookmark_index_unittest.cc | 222 const BookmarkNode* n1 = model_->AddURL(model_->other_node(), 0, local
229 EXPECT_TRUE(matches[0].node == n1);
|
