| /external/iptables/iptables/ |
| iptables-apply | 150 read -n1 -t "${TIMEOUT:-15}" ret 2>&1 || :
|
| /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/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/chrome/browser/bookmarks/ |
| 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/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);
|
| bookmark_model.h | 442 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) const {
443 return n1->url() < n2->url();
|
| bookmark_model.cc | 161 // Returns true if |n1| preceeds |n2|.
162 bool operator()(const BookmarkNode* n1, const BookmarkNode* n2) {
163 if (n1->type() == n2->type()) {
166 return n1->GetTitle() < n2->GetTitle();
168 collator_, n1->GetTitle(), n2->GetTitle()) == UCOL_LESS;
171 return n1->is_folder();
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/objects/ |
| o_names.c | 308 const OBJ_NAME * const *n1=n1_; local
311 return strcmp((*n1)->name,(*n2)->name);
|
| /external/chromium_org/v8/test/mjsunit/regress/ |
| regress-842.js | 36 var obj = { name: "n1" };
|
| /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/v8/test/mjsunit/regress/ |
| regress-842.js | 36 var obj = { name: "n1" };
|
| /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));
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_weakset.py | 413 n1 = len(s)
418 self.assertIn(n1, (0, 1))
437 n1 = len(s)
440 self.assertGreaterEqual(n1, 0)
441 self.assertLessEqual(n1, N)
443 self.assertLessEqual(n2, n1)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_weakset.py | 413 n1 = len(s)
418 self.assertIn(n1, (0, 1))
437 n1 = len(s)
440 self.assertGreaterEqual(n1, 0)
441 self.assertLessEqual(n1, N)
443 self.assertLessEqual(n2, n1)
|
| /external/qemu/ |
| exec.c | 733 unsigned int n1; local
737 n1 = (long)tb1 & 3;
740 *ptb = tb1->page_next[n1];
743 ptb = &tb1->page_next[n1];
750 unsigned int n1; local
758 n1 = (long)tb1 & 3;
760 if (n1 == n && tb1 == tb)
762 if (n1 == 2) {
765 ptb = &tb1->jmp_next[n1];
786 unsigned int h, n1; local
1301 unsigned int n1; local
[all...] |
| /external/clang/test/SemaCXX/ |
| warn-thread-safety-analysis.cpp | 3141 Node n1; local
[all...] |
| /external/bluetooth/bluedroid/stack/smp/ |
| aes.c | 232 { uint_8t p1 = x, p2 = BPOLY, n1 = hibit(x), n2 = 0x80, v1 = 1, v2 = 0; local
239 if(n1)
240 while(n2 >= n1) /* divide polynomial p2 by p1 */
242 n2 /= n1; /* shift smaller polynomial left */
251 while(n1 >= n2)
253 n1 /= n2;
254 p1 ^= p2 * n1;
255 v1 ^= v2 * n1;
256 n1 = hibit(p1);
|
| /external/chromium/testing/gtest/test/ |
| 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/chromium_org/testing/gtest/test/ |
| gtest_unittest.cc | 2130 const int n1 = 1; local
2148 const int n1 = 1; local
2165 int n1 = 0; local
2177 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/gtest/test/ |
| 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/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...] |
