| /external/openssl/crypto/ec/ |
| ectest.c | 198 BIGNUM *n1, *n2, *order; local
204 n1 = BN_new(); n2 = BN_new(); order = BN_new();
225 if (!BN_set_word(n1, i)) ABORT;
228 if (!EC_POINT_mul(group, P, n1, NULL, NULL, ctx)) ABORT;
230 if (!BN_one(n1)) ABORT;
231 /* n1 = 1 - order */
232 if (!BN_sub(n1, n1, order)) ABORT;
233 if (!EC_POINT_mul(group, Q, NULL, P, n1, ctx)) ABORT;
242 if (!BN_mul(n2, n1, n2, ctx)) ABORT
[all...] |
| /external/chromium_org/components/bookmarks/browser/ |
| bookmark_model.cc | 58 // Returns true if |n1| preceeds |n2|.
59 bool operator()(const BookmarkPermanentNode* n1,
61 bool n1_visible = client_->IsPermanentNodeVisible(n1);
78 // Returns true if |n1| preceeds |n2|.
79 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) {
80 if (n1->type() == n2->type()) {
83 return n1->GetTitle() < n2->GetTitle();
85 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
88 return n1->is_folder();
|
| bookmark_utils.cc | 68 bool MoreRecentlyModified(const BookmarkNode* n1, const BookmarkNode* n2) {
69 return n1->date_folder_modified() > n2->date_folder_modified();
298 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) {
299 return n1->date_added() > n2->date_added();
|
| /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_org/testing/gtest/test/ |
| gtest_output_test_.cc | 261 // waits for n1 | SCOPED_TRACE("Trace B");
263 // | notifies n1
281 Notification n1; member in struct:CheckPoints
291 check_points->n1.Notify();
309 check_points.n1.WaitForNotification();
|
| /external/glide/third_party/gif_decoder/src/main/java/com/bumptech/glide/gifdecoder/ |
| GifDecoder.java | 354 int n1 = (previousFrame.iy + i) * header.width + previousFrame.ix; local
355 int n2 = n1 + previousFrame.iw;
356 for (int k = n1; k < n2; k++) {
|
| /external/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/javassist/src/test/test/javassist/convert/ |
| ArrayAccessReplaceTest.java | 409 Number n1, n2, n3, n4; local
420 n1 = ns[1];
430 return n1;
|
| /frameworks/native/opengl/tests/hwc/ |
| hwcCommit.cpp | 396 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
397 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/opencv/ml/src/ |
| 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/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;
230 constexpr int n1 = 2 * 3 * 3 * 7 * 11 * 31 * 151 * 331; // ok member in namespace:UndefinedBehavior::Overflow
232 constexpr int n3 = n1 + 1; // ok
|
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_kissfft_impl.h | 283 void fwd2( Complex * dst,const Complex *src,int n0,int n1)
288 EIGEN_UNUSED_VARIABLE(n1);
292 void inv2( Complex * dst,const Complex *src,int n0,int n1)
297 EIGEN_UNUSED_VARIABLE(n1);
|
| /external/icu/icu4c/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);
466 assertTrue("count after unregister == count before register", n3 == n1);
|
| /external/iptables/iptables/ |
| iptables-apply | 151 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/chromium_org/v8/test/mjsunit/regress/ |
| regress-842.js | 36 var obj = { name: "n1" };
|
| /external/libcxx/test/strings/basic.string/string.ops/string_compare/ |
| size_size_pointer.pass.cpp | 12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1,
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
|
| /external/openssl/crypto/objects/ |
| o_names.c | 308 const OBJ_NAME * const *n1=n1_; local
311 return strcmp((*n1)->name,(*n2)->name);
|
| /external/pixman/test/ |
| utils.c | 657 int i, n1 = 1, n2 = 0; local
663 n1 = atoi (argv[1]);
665 if (n2 < n1)
680 n1 = 1;
686 shared(n1, n2, test_function, verbose)
688 for (i = n1; i <= n2; i++)
696 if (n1 == 1 && n2 == default_number_of_iterations)
712 printf ("%d-%d: checksum=%08X\n", n1, n2, checksum);
[all...] |
| /external/valgrind/main/coregrind/m_debuginfo/ |
| image.c | 288 ULong n1, ULong n2, ULong n3 )
295 write_ULong_le(&f->data[4 + 0*8], n1);
314 static Bool parse_Frame_le64 ( Frame* fr, const HChar* tag, /*OUT*/ULong* n1 )
321 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
326 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
333 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
366 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
375 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_compare/ |
| size_size_pointer.pass.cpp | 12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1,
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
|
| /bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
| misc.c | 465 int i, k1, n, n1; local
471 n1 = n + b->wds + 1;
472 for(i = b->maxwds; n1 > i; i <<= 1)
492 ++n1;
502 ++n1;
508 b1->wds = n1 - 1;
|
