Searched refs:n2 (Results 1 - 25 of 216) sorted by relevance

123456789

/macosx-10.10/ruby-106/ruby/missing/
H A Disnan.c5 static int double_ne(double n1, double n2);
14 double_ne(double n1, double n2) argument
16 return n1 != n2;
/macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/ecma_3/NumberFormatting/
H A Dtostring-001.js31 var n2 = 1.6e24;
38 reportCompare ("1.6e+24", n2.toString(), "1.6e24 toString()");
/macosx-10.10/Heimdal-398.1.2/lib/gssapi/netlogon/
H A Dcompare_name.c46 const gssnetlogon_name n2 = (const gssnetlogon_name)name2; local
50 if (n1->NetbiosName.value != NULL && n2->NetbiosName.value != NULL)
52 (char *)n2->NetbiosName.value) == 0);
54 if (n1->DnsName.value != NULL && n2->DnsName.value != NULL)
56 (char *)n2->DnsName.value) == 0);
/macosx-10.10/apache-793/httpd/modules/core/test/conf/
H A Dtest35.conf3 <Macro warnings u1 u2 n1 n2 u3>
5 # n1 n2
H A Dtest36.conf1 <Macro warnings $u $n $u1 $n1 $u2 $n2>
3 # $n $n1 $n2
/macosx-10.10/file_cmds-242/mtree/
H A Dspecspec.c94 mismatch(NODE *n1, NODE *n2, int differ, char const *path) argument
97 if (n2 == NULL) {
103 shownode(n2, differ, path);
111 shownode(n2, differ, path);
116 compare_nodes(NODE *n1, NODE *n2, char const *path) argument
122 if (n2 != NULL && n2->type == F_LINK)
123 n2->flags &= ~F_MODE;
125 if ((n1 == NULL) && (n2 == NULL)) {
128 differs = n2
180 NODE *c1, *c2, *n1, *n2; local
[all...]
/macosx-10.10/OpenSSL098-52/src/crypto/bn/
H A Dbn_mul.c382 /* 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 Dbn_sqr.c206 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
208 int n=n2/2;
213 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2);
215 if (n2 == 4)
224 else if (n2 == 8)
233 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
235 bn_sqr_normal(r,a,n2,t);
249 p= &(t[n2*2]);
252 bn_sqr_recursive(&(t[n2]),
[all...]
/macosx-10.10/Security-57031.1.35/Security/libsecurity_apple_csp/open_ssl/bn/
H A Dbn_mul.c85 /* r is 2*n2 words in size,
86 * a and b are both n2 words in size.
87 * n2 must be a power of 2.
89 * t must be 2*n2 words in size
95 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
98 int n=n2/2,c1,c2;
103 printf(" bn_mul_recursive %d * %d\n",n2,n2);
107 if (n2 == 4)
113 if (n2
244 int i,j,n2=n*2; local
412 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
443 bn_mul_high(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, BN_ULONG *l, int n2, BN_ULONG *t) argument
[all...]
H A Dbn_sqr.c218 void bn_sqr_recursive(BN_ULONG *r, BN_ULONG *a, int n2, BN_ULONG *t) argument
220 int n=n2/2;
225 printf(" bn_sqr_recursive %d * %d\n",n2,n2);
227 if (n2 == 4)
236 else if (n2 == 8)
245 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL)
247 bn_sqr_normal(r,a,n2,t);
261 p= &(t[n2*2]);
264 bn_sqr_recursive(&(t[n2]),
[all...]
/macosx-10.10/ICU-531.30/icuSources/common/
H A Dunorm.cpp51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode);
82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode));
89 return unorm2_isNormalized((const UNormalizer2 *)n2, sr
101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
117 _iterate(UCharIterator *src, UBool forward, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UBool doNormalize, UBool *pNeededToNormalize, UErrorCode *pErrorCode) argument
182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument
266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local
[all...]
/macosx-10.10/bzip2-36/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/macosx-10.10/OpenSSL098-52/src/crypto/rand/
H A Drandtest.c73 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];
/macosx-10.10/OpenSSL098-52/src/test/
H A Drandtest.c73 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];
/macosx-10.10/bash-94.1.2/bash-3.2/tests/misc/
H A Dperf-script3 typeset -i m2 m1 M n2 n1 N m n
28 let "n2 = N + 1"
38 let "y = (n-n1)*(n-N)*(n-n2)"
/macosx-10.10/OpenSSL098-52/src/ms/
H A Dcmp.pl15 $n2=sysread(IN1,$b2,4096);
17 last if ($n1 != $n2);
/macosx-10.10/ncurses-44/ncurses/ncurses/base/
H A Dlib_instr.c68 int n2; local
75 n2 = getcchar(cell, 0, 0, 0, 0);
76 if (n2 > 0
77 && (wch = typeCalloc(wchar_t, (unsigned) n2 + 1)) != 0) {
/macosx-10.10/bc-21/bc/lib/
H A Dnumber.c153 _bc_do_compare (n1, n2, use_sign, ignore_last)
154 bc_num n1, n2;
162 if (use_sign && n1->n_sign != n2->n_sign)
171 if (n1->n_len != n2->n_len)
173 if (n1->n_len > n2->n_len)
175 /* Magnitude of n1 > n2. */
183 /* Magnitude of n1 < n2. */
193 count = n1->n_len + MIN (n1->n_scale, n2->n_scale);
195 n2ptr = n2->n_value;
203 if (ignore_last && count == 1 && n1->n_scale == n2
657 _bc_simp_mul(bc_num n1, int n1len, bc_num n2, int n2len, bc_num *prod, int full_scale) argument
[all...]
/macosx-10.10/ksh-23/ksh/src/lib/libcmd/
H A Dcomm.c69 register int n1, n2, n, comp; local
73 n2 = sfvalue(in2);
76 n=(n1<n2?n1:n2);
77 if((comp=memcmp(cp1,cp2,n-1))==0 && (comp=n1-n2)==0)
93 n2 = sfvalue(in2);
101 if(sfwrite(out,cp2,n2) < 0)
105 n2 = sfvalue(in2);
120 n1 = n2;
/macosx-10.10/OpenSSL098-52/src/fips/
H A Dfips_utl.h82 int n1, n2; local
85 for (n1=0,n2=0 ; in[n1] && in[n1] != '\n' ; )
97 out[n2++]=ch;
100 out[n2] = ch << 4;
110 out[n2++] |= ch;
112 return n2;
228 int n1, n2; local
231 for (n1=0,n2=0 ; n1 < len ; ++n1)
235 out[n2++]=ch+'0';
237 out[n2
[all...]
/macosx-10.10/OpenSSL098-52/src/crypto/idea/
H A Di_skey.c147 long n1,n2,q,r,b1,b2,t; local
154 n2=xin;
159 r=(n1%n2);
160 q=(n1-r)/n2;
165 n1=n2;
166 n2=r;
/macosx-10.10/llvmCore-3425.0.34/unittests/VMCore/
H A DMetadataTest.cpp92 MDNode *n2 = MDNode::get(Context, c1); local
93 Value *const c2 = n2;
98 EXPECT_NE(n1, n2);
105 EXPECT_EQ(n5, n2);
113 EXPECT_EQ(1u, n2->getNumOperands());
114 EXPECT_EQ(n1, n2->getOperand(0));
138 MDNode *n2 = MDNode::get(Context, V2); local
144 NMD->addOperand(n2);
/macosx-10.10/text_cmds-88/sort/
H A Dmemcoll.c42 char n2 = s2[s2len]; local
73 s2[s2len - 1] = n2;
/macosx-10.10/ICU-531.30/icuSources/samples/uciter8/
H A Duciter8.c46 UCharIterator *iter2, const char *n2) {
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 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));
96 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));
114 log_err("%s->move(start) failed\n", n2);
118 log_err("%s->hasNext() at the start returns FALSE\n", n2);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
136 log_err("%s->hasNext() at the end returns TRUE\n", n2);
45 compareIterators(UCharIterator *iter1, const char *n1, UCharIterator *iter2, const char *n2) argument
[all...]
/macosx-10.10/ruby-106/ruby/test/rake/
H A Dtest_rake_definitions.rb33 def check_tasks(n1, n2, n3)
37 assert_equal [n2.to_s], t.prerequisites.collect{|n| n.to_s}
39 t2 = Task[n2]
42 assert_equal [n1.to_s, n2.to_s], t3.prerequisites.collect{|n|n.to_s}

Completed in 431 milliseconds

123456789