/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | InsnFormat.java | 542 * @param n2 {@code 0..15;} medium-high nibble 546 protected static short codeUnit(int n0, int n1, int n2, int n3) { argument 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));
|
/external/chromium_org/third_party/WebKit/Source/core/xml/ |
H A D | XPathParser.cpp | 257 String n2; local 258 if (!lexNCName(n2)) 261 name = n1 + ":" + n2; 368 String n2; local 369 if (!lexNCName(n2)) 372 name = name + ":" + n2;
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
H A D | AngleAxis.h | 160 Scalar n2 = q.vec().squaredNorm(); local 161 if (n2 < precision<Scalar>()*precision<Scalar>()) 169 m_axis = q.vec() / ei_sqrt(n2);
|
/external/eigen/Eigen/src/Geometry/ |
H A D | AngleAxis.h | 165 Scalar n2 = q.vec().squaredNorm(); 166 if (n2 < NumTraits<Scalar>::dummy_precision()*NumTraits<Scalar>::dummy_precision()) 174 m_axis = q.vec() / sqrt(n2);
|
/external/smali/util/src/main/java/ds/tree/ |
H A D | RadixTreeImpl.java | 227 RadixTreeNode<T> n2 = new RadixTreeNode<T>(); 228 n2.setKey(key.substring(numberOfMatchingCharacters, key.length())); 229 n2.setReal(true); 230 n2.setValue(value); 232 node.getChildern().add(n2);
|
/external/chromium_org/chrome/browser/undo/ |
H A D | bookmark_undo_service_test.cc | 154 const BookmarkNode* n2 = model->AddURL(model->other_node(), local 167 EXPECT_EQ(model->other_node()->GetChild(1), n2); 172 EXPECT_EQ(model->other_node()->GetChild(0), n2); 187 const BookmarkNode* n2 = model->AddURL(model->other_node(), local 203 EXPECT_EQ(model->other_node()->GetChild(1), n2); 212 EXPECT_EQ(model->other_node()->GetChild(1), n2);
|
/external/chromium_org/v8/src/compiler/ |
H A D | raw-machine-assembler.h | 393 Node* Phi(MachineType type, Node* n1, Node* n2) { argument 394 return NewNode(common()->Phi(type, 2), n1, n2); 396 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3) { argument 397 return NewNode(common()->Phi(type, 3), n1, n2, n3); 399 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3, Node* n4) { argument 400 return NewNode(common()->Phi(type, 4), n1, n2, n3, n4);
|
/external/valgrind/main/callgrind/ |
H A D | events.c | 80 const HChar* n2) 84 eg->name[1] = n2; 90 const HChar* n2, const HChar* n3) 94 eg->name[1] = n2; 101 const HChar* n2, const HChar* n3, 106 eg->name[1] = n2; 79 register_event_group2(int id, const HChar* n1, const HChar* n2) argument 89 register_event_group3(int id, const HChar* n1, const HChar* n2, const HChar* n3) argument 100 register_event_group4(int id, const HChar* n1, const HChar* n2, const HChar* n3, const HChar* n4) argument
|
/external/chromium_org/components/bookmarks/browser/ |
H A D | bookmark_model_unittest.cc | 101 void SwapDateAdded(BookmarkNode* n1, BookmarkNode* n2) { argument 103 n1->set_date_added(n2->date_added()); 104 n2->set_date_added(tmp); 746 // nodes: n1 > n2 > n3 > n4. 752 BookmarkNode* n2 = AsMutable(model_->AddURL(model_->bookmark_bar_node(), local 765 n2->set_date_added(base_time + TimeDelta::FromDays(3)); 774 ASSERT_TRUE(n2 == recently_added[1]); 778 SwapDateAdded(n1, n2); 781 ASSERT_TRUE(n2 == recently_added[0]); 790 // nodes: n1 > n2 795 BookmarkNode* n2 = AsMutable(model_->AddURL( local [all...] |
H A D | bookmark_utils.h | 78 // Returns true if |n1| was added more recently than |n2|. 79 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_convolve8_avg_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 89 "preceu.ph.qbl %[n2], %[tp2] \n\t" 93 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 107 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t" 118 "lbux %[n2], %[Temp4](%[cm]) \n\t" /* odd 2 */ 124 "addqh_r.w %[p2], %[p2], %[n2] \n\t" /* average odd 2 */ 130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
H A D | vp9_convolve8_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 86 "preceu.ph.qbl %[n2], %[tp2] \n\t" 90 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 100 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t" 108 "lbux %[n2], %[Temp4](%[cm]) \n\t" 114 "sb %[n2], 3(%[dst]) \n\t" 119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/ |
H A D | dwarf2-dbgfmt.c | 313 dwarf2_loc *n1, *n2; local 318 n2 = STAILQ_NEXT(n1, link); 320 n1 = n2;
|
/external/libvpx/libvpx/vp9/common/mips/dspr2/ |
H A D | vp9_convolve8_avg_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 89 "preceu.ph.qbl %[n2], %[tp2] \n\t" 93 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 107 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t" 118 "lbux %[n2], %[Temp4](%[cm]) \n\t" /* odd 2 */ 124 "addqh_r.w %[p2], %[p2], %[n2] \n\t" /* average odd 2 */ 130 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
H A D | vp9_convolve8_horiz_dspr2.c | 36 uint32_t n1, n2, n3, n4; local 86 "preceu.ph.qbl %[n2], %[tp2] \n\t" 90 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 100 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t" 108 "lbux %[n2], %[Temp4](%[cm]) \n\t" 114 "sb %[n2], 3(%[dst]) \n\t" 119 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3), [n4] "=&r" (n4),
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
H A D | TreeWizard.cs | 436 int n2 = tpattern.ChildCount; 437 if (n1 != n2) { 515 int n2 = adaptor.GetChildCount(t2); 516 if (n1 != n2) {
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
H A D | TreeWizard.cs | 500 int n2 = tpattern.ChildCount; 501 if ( n1 != n2 ) 589 int n2 = adaptor.GetChildCount( t2 ); 590 if ( n1 != n2 )
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | treewizard.py | 568 n2 = tpattern.getChildCount() 569 if n1 != n2: 609 n2 = adaptor.getChildCount(t2) 610 if n1 != n2:
|
/external/chromium_org/base/third_party/nspr/ |
H A D | prtime.cc | 902 int n1, n2, n3; local 931 n2 = (*s++ - '0'); 933 n2 = n2*10 + (*s++ - '0'); 971 if (n2 > 12) break; 978 month = (TIME_TOKEN)(n2 + ((int)TT_JAN) - 1); 984 if (n1 > 12 && n2 > 12) /* illegal */ 998 month = (TIME_TOKEN)(n2 + ((int)TT_JAN) - 1); 1006 date = n2;
|
/external/chromium_org/chrome/browser/notifications/ |
H A D | message_center_settings_controller.cc | 104 bool operator() (Notifier* n1, Notifier* n2) { argument 106 collator_, n1->name, n2->name) == UCOL_LESS; 113 bool SimpleCompareNotifiers(Notifier* n1, Notifier* n2) { argument 114 return n1->name < n2->name;
|
/external/chromium_org/tools/telemetry/telemetry/core/ |
H A D | bitmap.py | 40 n2 = sum(hist2) 43 if n2 == 0: 49 remainder += value1 * n2 - value2 * n1 54 return abs(float(total) / n1 / n2)
|
/external/clang/test/CodeGen/ |
H A D | struct.c | 52 struct NB *n2; member in struct:NB::_B2
|
/external/clang/test/Modules/ |
H A D | macros.c | 162 int n2 = TOP_OTHER_REDEF2; // ok variable
|
/external/clang/test/Sema/ |
H A D | struct-packed-align.c | 131 extern int n2[__alignof(struct nS) == 1 ? 1 : -1];
|
/external/icu/icu4c/source/test/cintltst/ |
H A D | custrtst.c | 1189 UCharIterator *iter2, const char *n2) { 1197 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); 1212 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); 1220 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 1229 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 1239 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 1257 log_err("%s->move(start) failed\n", n2); 1261 log_err("%s->hasNext() at the start returns FALSE\n", n2); 1269 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 1279 log_err("%s->hasNext() at the end returns TRUE\n", n2); 1188 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument [all...] |