/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/execute/ieee/ |
H A D | builtin-nan-1.c | 9 double n2 = __builtin_nan("0X1"); variable 13 if (memcmp (&n1, &n2, sizeof(double)))
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 930222-1.c | 7 f (T *n1, T *n2) argument 9 if (g (n2)) 10 return n1->i - n2->i; 13 double f = n1->f - n2->i;
|
H A D | pr37669.c | 10 int n1, n2, n3, n4, f5, f6; variable 21 chmap[(n2 >> 0) & 0x3f], chmap[(n2 >> 6) & 0x3f], 22 chmap[(n2 >> 12) & 0x3f], chmap[(n2 >> 18) & 0x3f], 23 chmap[(n2 >> 24) & 0x3f], chmap[(n2 >> 28) & 0x3f],
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.c-torture/compile/ |
H A D | 930222-1.c | 7 f (T *n1, T *n2) argument 9 if (g (n2)) 10 return n1->i - n2->i; 13 double f = n1->f - n2->i;
|
/netbsd-6-1-5-RELEASE/sys/arch/atari/stand/tostools/aptck/ |
H A D | setrev.awk | 5 function revcmp(r1, r2, n1, n2, a1, a2, n, i) { 7 n2 = split(r2, a2, "\.") 8 n = (n1 < n2) ? n1 : n2 14 if (n1 != n2) 15 return(n1 - n2)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/template/ |
H A D | friend47.C | 10 n<2> n2; local
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/gssapi/netlogon/ |
H A D | compare_name.c | 48 const gssnetlogon_name n2 = (const gssnetlogon_name)name2; local 52 if (n1->NetbiosName.value != NULL && n2->NetbiosName.value != NULL) 54 (char *)n2->NetbiosName.value) == 0); 56 if (n1->DnsName.value != NULL && n2->DnsName.value != NULL) 58 (char *)n2->DnsName.value) == 0);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
H A D | rtti1.cc | 58 // keep around a reference to 'obj' in n2::func - GCC 3.4 had been 60 void refer_to (n2::C2 *obj) 65 void refer_to (n2::n3::C3 *obj) 70 namespace n2 namespace 97 using namespace n2; 102 n2::func(); // main-constructs-done 103 n2::n3::func3();
|
H A D | rtti2.cc | 26 namespace n2 { namespace
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/g++.dg/ext/ |
H A D | cleanup-4.C | 21 static void doit(int n, int n2) argument 27 if (i == n2)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/ |
H A D | cleanup-4.c | 21 static void doit(int n, int n2) argument 27 if (i == n2)
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/testsuite/gcc.dg/ |
H A D | cleanup-4.c | 21 static void doit(int n, int n2) argument 27 if (i == n2)
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.target/i386/ |
H A D | amd64-abi-4.c | 9 int n2 = 324; variable 10 void *n3 = (void *) &n2; 41 test (n1, n2, n3, n4); 43 assert (n2 == e2);
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/engines/ccgost/ |
H A D | gost89.c | 142 register word32 n1, n2; /* As named in the GOST */ local 144 n2 = in[4]|(in[5]<<8)|(in[6]<<16)|(in[7]<<24); 147 n2 ^= f(c,n1+c->k[0]); n1 ^= f(c,n2+c->k[1]); 148 n2 ^= f(c,n1+c->k[2]); n1 ^= f(c,n2+c->k[3]); 149 n2 ^= f(c,n1+c->k[4]); n1 ^= f(c,n2+c->k[5]); 150 n2 ^= f(c,n1+c->k[6]); n1 ^= f(c,n2 175 register word32 n1, n2; /* As named in the GOST */ local 320 register word32 n1, n2; /* As named in the GOST */ local [all...] |
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/bn/ |
H A D | bn_mul.c | 382 /* r is 2*n2 words in size, 383 * a and b are both n2 words in size. 384 * n2 must be a power of 2. 386 * t must be 2*n2 words in size 392 /* dnX may not be positive, but n2/2+dnX has to be */ 393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument 396 int n=n2/2,c1,c2; 402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb); 406 if (n2 553 int i,j,n2=n*2; local 726 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument 757 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument [all...] |
H A D | bn_sqr.c | 207 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument 209 int n=n2/2; 214 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2); 216 if (n2 == 4) 225 else if (n2 == 8) 234 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) 236 bn_sqr_normal(r,a,n2,t); 250 p= &(t[n2*2]); 253 bn_sqr_recursive(&(t[n2]), [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | mullo_n.c | 68 split n = n1 + n2, where an = n1 <= n2 = (1-a)n; i.e. 0 < a <= 1/2. 112 ^ n2 ^n1^ 141 mp_size_t n2, n1; local 164 n2 = n - n1; 166 /* Split as x = x1 2^(n2 GMP_NUMB_BITS) + x0, 167 y = y1 2^(n2 GMP_NUMB_BITS) + y0 */ 170 mpn_mul_n (tp, xp, yp, n2); 171 MPN_COPY (rp, tp, n2); 173 /* x1 * y0 * 2^(n2 GMP_NUMB_BIT [all...] |
/netbsd-6-1-5-RELEASE/dist/bzip2/ |
H A D | bzmore | 16 n1=''; n2='\c' 18 n1='-n'; n2='' 44 echo $n1 "--More--(Next file: $FILE)$n2"
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/crypto/rand/ |
H A D | randtest.c | 73 unsigned long n2[16]; local 87 for (i=0; i<16; i++) n2[i]=0; 97 n2[j&0x0f]++; 98 n2[(j>>4)&0x0f]++; 137 d+=n2[i]*n2[i]; 147 d+=n2[i]*n2[i];
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libstdc++-v3/testsuite/27_io/basic_filebuf/overflow/wchar_t/ |
H A D | 11305-2.cc | 37 wfilebuf::int_type n2 = fb.sputc(0x40000000); local 41 VERIFY( n2 != wfilebuf::traits_type::eof() );
|
H A D | 11305-4.cc | 36 wfilebuf::int_type n2 = fb.sputc(0x40000000); local 40 VERIFY( n2 != wfilebuf::traits_type::eof() );
|
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/libstdc++-v3/testsuite/27_io/basic_filebuf/overflow/wchar_t/ |
H A D | 11305-2.cc | 38 wfilebuf::int_type n2 = fb.sputc(0x40000000); local 42 VERIFY( n2 != wfilebuf::traits_type::eof() );
|
H A D | 11305-4.cc | 37 wfilebuf::int_type n2 = fb.sputc(0x40000000); local 41 VERIFY( n2 != wfilebuf::traits_type::eof() );
|
/netbsd-6-1-5-RELEASE/crypto/external/bsd/openssl/dist/ms/ |
H A D | cmp.pl | 15 $n2=sysread(IN1,$b2,4096); 17 last if ($n1 != $n2);
|
/netbsd-6-1-5-RELEASE/gnu/dist/bc/lib/ |
H A D | number.c | 158 _bc_do_compare (n1, n2, use_sign, ignore_last) 159 bc_num n1, n2; 167 if (use_sign && n1->n_sign != n2->n_sign) 176 if (n1->n_len != n2->n_len) 178 if (n1->n_len > n2->n_len) 180 /* Magnitude of n1 > n2. */ 188 /* Magnitude of n1 < n2. */ 198 count = n1->n_len + MIN (n1->n_scale, n2->n_scale); 200 n2ptr = n2->n_value; 208 if (ignore_last && count == 1 && n1->n_scale == n2 662 _bc_simp_mul(bc_num n1, int n1len, bc_num n2, int n2len, bc_num *prod, int full_scale) argument [all...] |