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

12345678910

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libunistring-0.9.3/lib/
H A Dmemcmp2.c25 memcmp2 (const char *s1, size_t n1, const char *s2, size_t n2) argument
27 int cmp = memcmp (s1, s2, n1 <= n2 ? n1 : n2);
30 if (n1 < n2)
32 else if (n1 > n2)
H A Dmemcmp2.h27 /* Compare the memory regions S1 = [s1..s1+N1-1], S2 = [s2..s2+n2-1],
32 extern int memcmp2 (const char *s1, size_t n1, const char *s2, size_t n2);
H A Darray-mergesort.h36 /* Merge the sorted arrays src1[0..n1-1] and src2[0..n2-1] into
37 dst[0..n1+n2-1]. In case of ambiguity, put the elements of src1
39 n1 and n2 must be > 0.
41 src1 may be dst[n2..n1+n2-1], or src2 may be dst[n1..n1+n2-1]. */
44 const ELEMENT *src2, size_t n2,
47 for (;;) /* while (n1 > 0 && n2 > 0) */
59 n2--;
60 if (n2
43 merge(const ELEMENT *src1, size_t n1, const ELEMENT *src2, size_t n2, ELEMENT *dst) argument
169 size_t n2 = (n + 1) / 2; local
259 size_t n2 = (n + 1) / 2; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libunistring-0.9.3/lib/unistr/
H A Du-cmp2.h19 FUNC (const UNIT *s1, size_t n1, const UNIT *s2, size_t n2) argument
21 int cmp = U_CMP (s1, s2, MIN (n1, n2));
25 if (n1 < n2)
27 else if (n1 > n2)
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/
H A Dgost.cpp65 word32 n1, n2, t; local
67 Block::Get(inBlock)(n1)(n2);
71 n2 ^= f(n1+key[0]);
72 n1 ^= f(n2+key[1]);
73 n2 ^= f(n1+key[2]);
74 n1 ^= f(n2+key[3]);
75 n2 ^= f(n1+key[4]);
76 n1 ^= f(n2+key[5]);
77 n2 ^= f(n1+key[6]);
78 n1 ^= f(n2
95 word32 n1, n2, t; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/engines/ccgost/
H A Dgost89.c244 register word32 n1, n2; /* As named in the GOST */ local
246 n2 = in[4] | (in[5] << 8) | (in[6] << 16) | ((word32) in[7] << 24);
249 n2 ^= f(c, n1 + c->k[0]);
250 n1 ^= f(c, n2 + c->k[1]);
251 n2 ^= f(c, n1 + c->k[2]);
252 n1 ^= f(c, n2 + c->k[3]);
253 n2 ^= f(c, n1 + c->k[4]);
254 n1 ^= f(c, n2 + c->k[5]);
255 n2 ^= f(c, n1 + c->k[6]);
256 n1 ^= f(c, n2
298 register word32 n1, n2; /* As named in the GOST */ local
461 register word32 n1, n2; /* As named in the GOST */ local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/engines/ccgost/
H A Dgost89.c244 register word32 n1, n2; /* As named in the GOST */ local
246 n2 = in[4] | (in[5] << 8) | (in[6] << 16) | ((word32) in[7] << 24);
249 n2 ^= f(c, n1 + c->k[0]);
250 n1 ^= f(c, n2 + c->k[1]);
251 n2 ^= f(c, n1 + c->k[2]);
252 n1 ^= f(c, n2 + c->k[3]);
253 n2 ^= f(c, n1 + c->k[4]);
254 n1 ^= f(c, n2 + c->k[5]);
255 n2 ^= f(c, n1 + c->k[6]);
256 n1 ^= f(c, n2
298 register word32 n1, n2; /* As named in the GOST */ local
461 register word32 n1, n2; /* As named in the GOST */ local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/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 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
395 int n=n2/2,c1,c2;
401 fprintf(stderr," bn_mul_recursive %d * %d\n",n2,n2);
405 if (n2 == 4)
411 /* Only call bn_mul_comba 8 if n2
551 int i,j,n2=n*2; local
724 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
755 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...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/bn/
H A Dbn_mul.c416 * r is 2*n2 words in size,
417 * a and b are both n2 words in size.
418 * n2 must be a power of 2.
420 * t must be 2*n2 words in size
426 /* dnX may not be positive, but n2/2+dnX has to be */
427 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
430 int n = n2 / 2, c1, c2;
436 fprintf(stderr, " bn_mul_recursive %d%+d * %d%+d\n", n2, dna, n2, dnb);
440 if (n2
580 int i, j, n2 = n * 2; local
739 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
768 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.c204 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
206 int n = n2 / 2;
211 fprintf(stderr, " bn_sqr_recursive %d * %d\n", n2, n2);
213 if (n2 == 4) {
220 } else if (n2 == 8) {
228 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) {
229 bn_sqr_normal(r, a, n2, t);
243 p = &(t[n2 * 2]);
246 bn_sqr_recursive(&(t[n2]),
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/bn/
H A Dbn_mul.c416 * r is 2*n2 words in size,
417 * a and b are both n2 words in size.
418 * n2 must be a power of 2.
420 * t must be 2*n2 words in size
426 /* dnX may not be positive, but n2/2+dnX has to be */
427 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, argument
430 int n = n2 / 2, c1, c2;
436 fprintf(stderr, " bn_mul_recursive %d%+d * %d%+d\n", n2, dna, n2, dnb);
440 if (n2
580 int i, j, n2 = n * 2; local
739 bn_mul_low_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, BN_ULONG *t) argument
768 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.c204 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) argument
206 int n = n2 / 2;
211 fprintf(stderr, " bn_sqr_recursive %d * %d\n", n2, n2);
213 if (n2 == 4) {
220 } else if (n2 == 8) {
228 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) {
229 bn_sqr_normal(r, a, n2, t);
243 p = &(t[n2 * 2]);
246 bn_sqr_recursive(&(t[n2]),
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/minidlna/ffmpeg-2.3.4/libavcodec/x86/
H A Dlpc.c38 int n2 = len>>1; local
39 x86_reg i = -n2*sizeof(int32_t);
40 x86_reg j = n2*sizeof(int32_t);
74 :"r"(w_data+n2), "r"(data+n2), "m"(c), "r"(len)
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libav-0.8.8/libavcodec/x86/
H A Dlpc_mmx.c30 int n2 = len>>1; local
31 x86_reg i = -n2*sizeof(int32_t);
32 x86_reg j = n2*sizeof(int32_t);
66 :"r"(w_data+n2), "r"(data+n2), "m"(c), "r"(len)
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/bzip2/
H A Dbzmore16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/crypto/rand/
H A Drandtest.c73 unsigned long n2[16]; local
89 n2[i] = 0;
99 n2[j & 0x0f]++;
100 n2[(j >> 4) & 0x0f]++;
139 d += n2[i] * n2[i];
148 d += n2[i] * n2[i];
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/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];
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/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];
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/crypto/rand/
H A Drandtest.c73 unsigned long n2[16]; local
89 n2[i] = 0;
99 n2[j & 0x0f]++;
100 n2[(j >> 4) & 0x0f]++;
139 d += n2[i] * n2[i];
148 d += n2[i] * n2[i];
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl-1.0.2h/ms/
H A Dcmp.pl15 $n2=sysread(IN1,$b2,4096);
17 last if ($n1 != $n2);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/openssl-0.9.8e/ms/
H A Dcmp.pl15 $n2=sysread(IN1,$b2,4096);
17 last if ($n1 != $n2);
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openssl/ms/
H A Dcmp.pl15 $n2=sysread(IN1,$b2,4096);
17 last if ($n1 != $n2);
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/char/hw_random/
H A DMakefile11 obj-$(CONFIG_HW_RANDOM_N2RNG) += n2-rng.o
12 n2-rng-y := n2-drv.o n2-asm.o
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/
H A Dgsmmux.h12 unsigned int n2; member in struct:gsm_config

Completed in 266 milliseconds

12345678910