| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| InsnFormat.java | 442 * @param n2 {@code 0..15;} medium-high nibble
446 protected static short codeUnit(int n0, int n1, int n2, int n3) {
455 if ((n2 & 0xf) != n2) {
456 throw new IllegalArgumentException("n2 out of range 0..15");
463 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
| /dalvik/dx/src/com/android/dx/dex/code/ |
| InsnFormat.java | 540 * @param n2 {@code 0..15;} medium-high nibble
544 protected static short codeUnit(int n0, int n1, int n2, int n3) {
553 if ((n2 & 0xf) != n2) {
554 throw new IllegalArgumentException("n2 out of range 0..15");
561 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeWizard.java | 351 int n2 = tpattern.getChildCount(); local
352 if ( n1 != n2 ) {
419 int n2 = adaptor.getChildCount(t2); local
420 if ( n1 != n2 ) {
|
| /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/ |
| SHA1PRNG_SecureRandomTest.java | 161 int n2 = 20; local
164 byte[][] bytes2 = new byte[ 5][n2];
176 int i3 = k /n2;
177 int i4 = k %n2;
|
| /external/chromium_org/chrome/browser/bookmarks/ |
| bookmark_utils.cc | 49 bool MoreRecentlyModified(const BookmarkNode* n1, const BookmarkNode* n2) {
50 return n1->date_folder_modified() > n2->date_folder_modified();
203 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2) {
204 return n1->date_added() > n2->date_added();
|
| bookmark_utils.h | 60 // Returns true if |n1| was added more recently than |n2|.
61 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2);
|
| bookmark_utils_unittest.cc | 36 const BookmarkNode* n2 = model.AddURL(model.other_node(), local
54 EXPECT_TRUE(nodes[0] == n2);
55 EXPECT_TRUE(DoesBookmarkContainText(n2, ASCIIToUTF16("cnn"), string()));
|
| bookmark_model_unittest.cc | 103 void SwapDateAdded(BookmarkNode* n1, BookmarkNode* n2) {
105 n1->set_date_added(n2->date_added());
106 n2->set_date_added(tmp);
700 // nodes: n1 > n2 > n3 > n4.
706 BookmarkNode* n2 = AsMutable(model_.AddURL(model_.bookmark_bar_node(), local
719 n2->set_date_added(base_time + TimeDelta::FromDays(3));
728 ASSERT_TRUE(n2 == recently_added[1]);
732 SwapDateAdded(n1, n2);
735 ASSERT_TRUE(n2 == recently_added[0]);
744 // nodes: n1 > n2
749 BookmarkNode* n2 = AsMutable(model_.AddURL( local
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| fts1_hash.c | 102 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
103 if( n1!=n2 ) return 1;
118 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
119 if( n1!=n2 ) return 1;
|
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2_hash.c | 107 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
108 if( n1!=n2 ) return 1;
123 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
124 if( n1!=n2 ) return 1;
|
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| fts3_hash.c | 107 static int fts3StrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
108 if( n1!=n2 ) return 1;
123 static int fts3BinCompare(const void *pKey1, int n1, const void *pKey2, int n2){
124 if( n1!=n2 ) return 1;
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
| InsnFormat.java | 542 * @param n2 {@code 0..15;} medium-high nibble
546 protected static short codeUnit(int n0, int n1, int n2, int n3) {
555 if ((n2 & 0xf) != n2) {
556 throw new IllegalArgumentException("n2 out of range 0..15");
563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
|
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/provider/crypto/ |
| SHA1PRNG_SecureRandomTest.java | 153 int n2 = 20; local
156 byte[][] bytes2 = new byte[5][n2];
168 int i3 = k / n2;
169 int i4 = k % n2;
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/netax25/ |
| ax25.h | 115 unsigned int n2, n2count; member in struct:ax25_info_struct
158 #define AX25_VALUES_N2 11 /* Default N2 value */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/netax25/ |
| ax25.h | 115 unsigned int n2, n2count; member in struct:ax25_info_struct
158 #define AX25_VALUES_N2 11 /* Default N2 value */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/netax25/ |
| ax25.h | 115 unsigned int n2, n2count; member in struct:ax25_info_struct
158 #define AX25_VALUES_N2 11 /* Default N2 value */
|
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathParser.cpp | 258 String n2; local
259 if (!lexNCName(n2))
262 name = n1 + ":" + n2;
368 String n2; local
369 if (!lexNCName(n2))
372 name = name + ":" + n2;
|
| /external/eigen/Eigen/src/Geometry/ |
| AngleAxis.h | 164 Scalar n2 = q.vec().squaredNorm();
165 if (n2 < NumTraits<Scalar>::dummy_precision()*NumTraits<Scalar>::dummy_precision())
173 m_axis = q.vec() / internal::sqrt(n2);
|
| /external/smali/util/src/main/java/ds/tree/ |
| RadixTreeImpl.java | 227 RadixTreeNode<T> n2 = new RadixTreeNode<T>(); local
228 n2.setKey(key.substring(numberOfMatchingCharacters, key.length()));
229 n2.setReal(true);
230 n2.setValue(value);
232 node.getChildern().add(n2);
|
| /bionic/libc/stdio/ |
| vfprintf.c | 174 int n, m, n2; /* handy integers (short term usage) */ local
280 n2 = 0; \
283 n2 = 10 * n2 + to_digit(*cp); \
292 nextarg = n2; \
878 int n, n2; /* handy integer (short term usage) */ local
918 n2 = 0; \
921 n2 = 10 * n2 + to_digit(*cp); \
926 nextarg = n2; \
[all...] |
| /external/valgrind/main/callgrind/ |
| events.c | 79 EventGroup* CLG_(register_event_group2)(int id, Char* n1, Char* n2)
83 eg->name[1] = n2;
88 EventGroup* CLG_(register_event_group3)(int id, Char* n1, Char* n2, Char* n3)
92 eg->name[1] = n2;
99 Char* n1, Char* n2, Char* n3, Char* n4)
103 eg->name[1] = n2;
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_index.py | 78 self.n2 = newstyle()
90 self.n2.ind = 4
92 self.assertEqual(self.seq[self.n:self.n2], self.seq[2:4])
106 self.n2.ind = -int(seqlen * 1.5)
109 self.assertEqual(self.seq[self.n2:], self.seq)
110 self.assertEqual(self.seq[:self.n2], self.seq[0:0])
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_index.py | 78 self.n2 = newstyle()
90 self.n2.ind = 4
92 self.assertEqual(self.seq[self.n:self.n2], self.seq[2:4])
106 self.n2.ind = -int(seqlen * 1.5)
109 self.assertEqual(self.seq[self.n2:], self.seq)
110 self.assertEqual(self.seq[:self.n2], self.seq[0:0])
|
| /external/chromium/chrome/browser/task_manager/ |
| task_manager_browsertest.cc | 327 scoped_refptr<NotificationDelegate> del2(new MockNotificationDelegate("n2"));
328 Notification n2(
333 notifications->Add(n2, browser()->profile());
337 notifications->CancelById(n2.notification_id());
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/ |
| dwarf2-dbgfmt.c | 313 dwarf2_loc *n1, *n2; local
318 n2 = STAILQ_NEXT(n1, link);
320 n1 = n2;
|
