HomeSort by relevance Sort by last modified time
    Searched refs:n2 (Results 76 - 100 of 228) sorted by null

1 2 34 5 6 7 8 910

  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
353 n2=db_sqr(C[8]) +db_sqr(C[9]) +db_sqr(C[10])+db_sqr(C[11]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
368 else if(n2>=n3)
370 m=db_SafeReciprocal(sqrt(n2));
  /external/openssl/crypto/ec/
ecp_smpl.c 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
673 n2 = BN_CTX_get(ctx);
685 /* n1, n2 */
689 if (!BN_copy(n2, &a->Y)) goto end;
691 /* n2 = Y_a */
700 if (!field_mul(group, n2, &a->Y, n0, ctx)) goto end;
701 /* n2 = Y_a * Z_b^3 */
725 if (!BN_mod_sub_quick(n6, n2, n4, p)) goto end;
727 /* n6 = n2 - n4 */
751 if (!BN_mod_add_quick(n2, n2, n4, p)) goto end
813 BIGNUM *n0, *n1, *n2, *n3; local
    [all...]
  /external/qemu/slirp-android/
tcp_subr.c 767 u_int n1, n2, n3, n4, n5, n6; local
795 if (sscanf(so_rcv->sb_data, "%u%*[ ,]%u", &n1, &n2) == 2) {
796 /* n2 is the one on our host */
799 tmpso->so_laddr_port == n2 &&
803 n2 = sock_address_get_port(&addr);
810 "%d,%d\r\n", n1, n2);
825 &n1, &n2, &n3, &n4, &n5, &n6, buff);
829 laddr = (n1 << 24) | (n2 << 16) | (n3 << 8) | (n4);
843 n2 = ((laddr >> 16) & 0xff);
850 n1, n2, n3, n4, n5, n6, x==7?buff:"")
    [all...]
  /external/opencv/ml/src/
mlann_mlp.cpp 183 int n2 = layer_sizes->data.i[i]; local
184 double val = 0, G = n2 > 2 ? 0.7*pow((double)n1,1./(n2-1)) : 1.;
188 for( j = 0; j < n2; j++ )
194 w[k*n2 + j] = val;
202 w[k*n2 + j] *= s;
203 w[n1*n2 + j] *= G*(-1+j*2./n2);
1017 int n1 = layer_sizes->data.i[i-1], n2 = layer_sizes->data.i[i]; local
1018 cvInitMatHeader( &_df, 1, n2, CV_64F, df[i] )
1129 int n1, n2, si, j, k; local
    [all...]
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/manifest/pages/
ApplicationAttributesPart.java 119 int n2 = (int) Math.ceil(n / 2.0); local
121 AttributeDescriptor attr_desc = attr_desc_list[i / 2 + (i & 1) * n2];
  /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 541 * @param n2 {@code 0..15;} medium-high nibble
545 protected static short codeUnit(int n0, int n1, int n2, int n3) {
554 if ((n2 & 0xf) != n2) {
555 throw new IllegalArgumentException("n2 out of range 0..15");
562 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/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));
  /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/webkit/Source/WebCore/xml/
XPathParser.cpp 263 String n2; local
264 if (!lexNCName(n2))
267 name = n1 + ":" + n2;
373 String n2; local
374 if (!lexNCName(n2))
377 name = name + ":" + 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);
  /system/core/fs_mgr/
fs_mgr.c 402 char *n2; local
406 n2 = strdup(in2);
409 remove_trailing_slashes(n2);
411 ret = !strcmp(n1, n2);
414 free(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; \
877 int n, n2; /* handy integer (short term usage) */ local
917 n2 = 0; \
920 n2 = 10 * n2 + to_digit(*cp); \
925 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;
  /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/dropbear/libtommath/
bn_mp_div.c 24 int res, n, n2; local
74 n2 = (a->sign == b->sign ? MP_ZPOS : MP_NEG);
77 c->sign = (mp_iszero(c) == MP_YES) ? MP_ZPOS : n2;
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
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/
TreeWizard.cs 500 int n2 = tpattern.ChildCount;
501 if ( n1 != n2 )
589 int n2 = adaptor.GetChildCount( t2 );
590 if ( n1 != n2 )
  /external/chromium/base/third_party/nspr/
prtime.cc 870 int n1, n2, n3; local
    [all...]
  /external/clang/test/CodeGen/
struct.c 52 struct NB *n2; member in struct:NB::_B2
  /external/clang/test/Sema/
struct-packed-align.c 130 extern int n2[__alignof(struct nS) == 1 ? 1 : -1];

Completed in 924 milliseconds

1 2 34 5 6 7 8 910