HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 126 - 150 of 365) sorted by null

1 2 3 4 56 7 8 91011>>

  /frameworks/native/opengl/tests/hwc/
hwcTestLib.cpp 358 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
359 if (string(desc) == string(hwcTestGraphicFormat[n1].desc)) {
360 return &hwcTestGraphicFormat[n1];
372 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
373 if (id == hwcTestGraphicFormat[n1].format) {
374 return &hwcTestGraphicFormat[n1];
    [all...]
hwcColorEquiv.cpp 436 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
437 testPrintE(" %s", hwcTestGraphicFormat[n1].desc);
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/preprocessed/gcc/
bind.hpp 80 typedef typename r0::next n1; typedef in struct:boost::mpl::bind0::apply
132 typedef typename r0::next n1; typedef in struct:boost::mpl::bind1::apply
135 typedef aux::replace_unnamed_arg< T1,n1 > r1;
190 typedef typename r0::next n1; typedef in struct:boost::mpl::bind2::apply
193 typedef aux::replace_unnamed_arg< T1,n1 > r1;
253 typedef typename r0::next n1; typedef in struct:boost::mpl::bind3::apply
256 typedef aux::replace_unnamed_arg< T1,n1 > r1;
321 typedef typename r0::next n1; typedef in struct:boost::mpl::bind4::apply
324 typedef aux::replace_unnamed_arg< T1,n1 > r1;
396 typedef typename r0::next n1; typedef in struct:boost::mpl::bind5::apply
486 typedef mpl::arg<1> n1; typedef in struct:boost::mpl::bind3::apply
534 typedef mpl::arg<1> n1; typedef in struct:boost::mpl::bind3::apply
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeWizard.cs 435 int n1 = adaptor.GetChildCount(t1);
437 if (n1 != n2) {
440 for (int i = 0; i < n1; i++) {
514 int n1 = adaptor.GetChildCount(t1);
516 if (n1 != n2) {
519 for (int i = 0; i < n1; i++) {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeWizard.cs 499 int n1 = adaptor.GetChildCount( t1 );
501 if ( n1 != n2 )
505 for ( int i = 0; i < n1; i++ )
588 int n1 = adaptor.GetChildCount( t1 );
590 if ( n1 != n2 )
594 for ( int i = 0; i < n1; i++ )
  /external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/dwarf2/
dwarf2-info.c 370 dwarf2_abbrev_attr *n1, *n2; local
373 n1 = STAILQ_FIRST(&abbrev->attrs);
374 while (n1) {
375 n2 = STAILQ_NEXT(n1, link);
376 yasm_xfree(n1);
377 n1 = n2;
  /external/chromium_org/v8/test/mjsunit/tools/
profile_view.js 84 view.sort(function(n1, n2) {
85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
86 (n1.selfTime - n2.selfTime);
  /external/smali/util/src/main/java/ds/tree/
RadixTreeImpl.java 215 RadixTreeNode<T> n1 = new RadixTreeNode<T>(); local
216 n1.setKey(node.getKey().substring(numberOfMatchingCharacters, node.getKey().length()));
217 n1.setReal(node.isReal());
218 n1.setValue(node.getValue());
219 n1.setChildern(node.getChildern());
224 node.getChildern().add(n1);
  /external/stlport/src/c_locale_win32/
c_wlocale_win32.c 198 const wchar_t* s1, size_t n1,
201 while (n1 > 0 || n2 > 0) {
202 DWORD size1 = trim_size_t_to_DWORD(n1);
207 n1 -= size1;
214 const wchar_t* s1, size_t n1,
217 result = _WLocale_strcmp_aux(lcol, s1, n1, s2, n2);
  /external/v8/test/mjsunit/tools/
profile_view.js 84 view.sort(function(n1, n2) {
85 return cmpStrs(n1.internalFuncName, n2.internalFuncName) ||
86 (n1.selfTime - n2.selfTime);
  /ndk/sources/cxx-stl/stlport/src/c_locale_win32/
c_wlocale_win32.c 198 const wchar_t* s1, size_t n1,
201 while (n1 > 0 || n2 > 0) {
202 DWORD size1 = trim_size_t_to_DWORD(n1);
207 n1 -= size1;
214 const wchar_t* s1, size_t n1,
217 result = _WLocale_strcmp_aux(lcol, s1, n1, s2, n2);
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
365 m=db_SafeReciprocal(sqrt(n1));
  /packages/apps/Camera2/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
365 m=db_SafeReciprocal(sqrt(n1));
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
365 m=db_SafeReciprocal(sqrt(n1));
  /external/genext2fs/
mkbootimg_ext2.sh 94 num_blocks=`du -sk $TMPDIR | tail -n1 | awk '{print $1;}'`
  /external/valgrind/main/callgrind/
events.c 71 EventGroup* CLG_(register_event_group) (int id, Char* n1)
74 eg->name[0] = n1;
79 EventGroup* CLG_(register_event_group2)(int id, Char* n1, Char* n2)
82 eg->name[0] = n1;
88 EventGroup* CLG_(register_event_group3)(int id, Char* n1, Char* n2, Char* n3)
91 eg->name[0] = n1;
99 Char* n1, Char* n2, Char* n3, Char* n4)
102 eg->name[0] = n1;
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
InsnFormat.java 441 * @param n1 {@code 0..15;} medium-low nibble
446 protected static short codeUnit(int n0, int n1, int n2, int n3) {
451 if ((n1 & 0xf) != n1) {
452 throw new IllegalArgumentException("n1 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 539 * @param n1 {@code 0..15;} medium-low nibble
544 protected static short codeUnit(int n0, int n1, int n2, int n3) {
549 if ((n1 & 0xf) != n1) {
550 throw new IllegalArgumentException("n1 out of range 0..15");
561 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 160 int n1 = 10; local
163 byte[][] bytes1 = new byte[10][n1];
174 int i1 = k /n1;
175 int i2 = k %n1;
  /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);
  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
InsnFormat.java 541 * @param n1 {@code 0..15;} medium-low nibble
546 protected static short codeUnit(int n0, int n1, int n2, int n3) {
551 if ((n1 & 0xf) != n1) {
552 throw new IllegalArgumentException("n1 out of range 0..15");
563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /frameworks/base/tests/backup/
test_restore.sh 69 restore_set=$(a shell bmgr list sets | head -n1 | awk '{print $1}')
  /libcore/luni/src/test/java/org/apache/harmony/security/tests/provider/crypto/
SHA1PRNG_SecureRandomTest.java 152 int n1 = 10; local
155 byte[][] bytes1 = new byte[10][n1];
166 int i1 = k / n1;
167 int i2 = k % n1;
  /system/extras/tests/bionic/libc/
run-test.sh 142 RET=`tail -n1 $ADB_CMD_LOG`

Completed in 2008 milliseconds

1 2 3 4 56 7 8 91011>>