| /src/external/bsd/openldap/dist/servers/slapd/back-sock/ |
| search.c | 47 AttributeName *an; local
68 for ( an = op->oq_search.rs_attrs; an && an->an_name.bv_val; an++ ) {
69 fprintf( fp, " %s", an->an_name.bv_val );
|
| /src/games/primes/ |
| spsp.c | 54 uint64_t an = a % n; local
58 x += an;
59 if ((x < an) || (x >= n))
62 if (an + an < an)
63 an = an + an - n;
64 else if (an + an >= n
[all...] |
| /src/external/bsd/openldap/dist/servers/slapd/back-perl/ |
| search.c | 34 AttributeName *an; local
55 for ( an = op->ors_attrs; an && an->an_name.bv_val; an++ ) {
56 XPUSHs(sv_2mortal(newSVpv( an->an_name.bv_val , an->an_name.bv_len)));
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| gcd_subdiv_step.c | 80 mp_size_t an, bn, qn; local
87 an = bn = n;
88 MPN_NORMALIZE (ap, an);
95 if (an == bn)
98 MPN_CMP (c, ap, bp, an);
104 hook (ctx, ap, an, NULL, 0, -1);
115 if (an > bn)
117 MPN_PTR_SWAP (ap, an, bp, bn);
121 if (an <= s)
128 ASSERT_NOCARRY (mpn_sub (bp, bp, bn, ap, an));
[all...] |
| hgcd_reduce.c | 39 to size an, and resulting size is returned. */
42 mp_srcptr ap, mp_size_t an, mp_srcptr bp, mp_size_t bn)
48 ASSERT (an >= bn);
49 ASSERT (rn >= an);
50 ASSERT (an + bn <= rn + 1);
53 tp = TMP_ALLOC_LIMBS (an + bn);
55 mpn_mul (tp, ap, an, bp, bn);
56 ASSERT ((an + bn <= rn) || (tp[rn] == 0));
57 ASSERT_NOCARRY (mpn_sub (rp, rp, rn, tp, an + bn - (an + bn > rn)))
77 mp_size_t an, bn, un, vn, nn; local
[all...] |
| /src/external/lgpl3/gmp/dist/mini-gmp/tests/ |
| t-limbs.c | 35 mp_size_t tn, an, bn; local
37 an = mpz_size (a);
40 assert (an > 0);
43 tn = an + bn;
45 if (an > bn)
46 mpn_mul (tp, mpz_limbs_read (a), an, mpz_limbs_read (b), bn);
48 mpn_mul (tp, mpz_limbs_read (b), bn, mpz_limbs_read (a), an);
84 points to a buffer with at least an+bn limbs, and the limbs
|
| t-mpq_muldiv.c | 53 mpz_t an, bn, rn, ad, bd, rd; local
56 mpz_init (an);
69 mini_random_op3 (OP_MUL, MAXBITS, an, bn, rn);
74 _mpq_set_zz (aq, an, ad);
82 dump ("an", an);
102 dump ("an", an);
118 dump ("an", an);
[all...] |
| t-mul.c | 39 mp_size_t an; local
63 an = mpz_size (a);
64 if (an > 0)
66 mpn_mul_n (t, a->_mp_d, b->_mp_d, an);
68 mpz_roinit_n (tz, t, 2*an);
92 an = mpz_size (a);
93 if (an > 0)
96 mpn_sqr (t, mpz_limbs_read (a), an);
98 mpz_roinit_n (tz, t, 2*an);
|
| /src/external/lgpl3/gmp/dist/tests/mpn/ |
| t-mul.c | 53 mp_size_t max_n, an, bn, rn; local
71 for (an = 1; an <= max_n; an += 1)
73 for (bn = 1; bn <= an; bn += 1)
75 mpn_random2 (ap, an + 1);
78 refmpn_mul (refp, ap, an, bp, bn);
79 mpn_mul (rp, ap, an, bp, bn);
81 rn = an + bn;
84 printf ("ERROR, an = %d, bn = %d, rn = %d\n"
[all...] |
| t-mulmid.c | 57 mp_size_t an, bn, rn; local
61 an = 1 + gmp_urandomm_ui(rands, 1L << size_log);
66 /* Make sure an >= bn */
67 if (an < bn)
68 MP_SIZE_T_SWAP (an, bn);
70 mpn_random2 (ap, an);
73 refmpn_mulmid (refp, ap, an, bp, bn);
74 mpn_mulmid (rp, ap, an, bp, bn);
76 rn = an + 3 - bn;
79 printf ("ERROR in test %d, an = %d, bn = %d, rn = %d\n"
[all...] |
| toom-sqr-shared.h | 59 mp_size_t an; local
63 an = MIN_AN
66 mpn_random2 (ap, an);
67 mpn_random2 (pp-1, an * 2 + 2);
69 p_after = pp[an * 2];
71 itch = mpn_toomN_sqr_itch (an);
77 mpn_toomN_sqr (pp, ap, an, scratch);
78 refmpn_mul (refp, ap, an, ap, an);
79 if (pp[-1] != p_before || pp[an * 2] != p_afte
[all...] |
| t-mulmod_bnm1.c | 52 ref_mulmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an, mp_srcptr bp, mp_size_t bn)
56 ASSERT (0 < an && an <= rn);
59 if (an >= bn)
60 refmpn_mul (rp, ap, an, bp, bn);
62 refmpn_mul (rp, bp, bn, ap, an);
63 an += bn;
64 if (an > rn) {
65 cy = mpn_add (rp, rp, rn, rp + rn, an - rn);
105 mp_size_t an,bn,rn,n local
[all...] |
| t-sqrmod_bnm1.c | 52 ref_sqrmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an)
56 ASSERT (0 < an && an <= rn);
58 refmpn_mul (rp, ap, an, ap, an);
59 an *= 2;
60 if (an > rn) {
61 cy = mpn_add (rp, rp, rn, rp + rn, an - rn);
100 mp_size_t an,rn,n; local
107 /* We generate an in the MIN_N <= n <= (1 << size_range). *
[all...] |
| toom-shared.h | 28 * mpn_toomMN_mul_itch, MIN_AN, MIN_BN(an), MAX_BN(an) and then
43 #define MAX_BN(an) (an)
48 * MIN_BN(an) = N + floor(((N-1)*an + M - N)/M)
50 * MAX_BN(an) = floor(N*(an-1)/(M-1)) - N + 1
80 mp_size_t an, bn; local
87 /* We generate an in the MIN_AN <= an <= (1 << size_range). *
[all...] |
| t-matrix22.c | 81 #define MUL(rp, ap, an, bp, bn) do { \
82 if (an > bn) \
83 mpn_mul (rp, ap, an, bp, bn); \
85 mpn_mul (rp, bp, bn, ap, an); \
93 mp_size_t an, bn, n; local
102 an = A->n, bn = B->n;
111 an = B->n, bn = A->n;
113 n = an + bn;
116 mpn_mul (r00, a00, an, b00, bn);
117 mpn_mul (tp, a01, an, b10, bn)
189 mp_size_t an, bn; local
[all...] |
| /src/dist/pf/libexec/tftp-proxy/ |
| filter.c | 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
195 char an[PF_ANCHOR_NAME_SIZE]; local
203 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
207 strlcpy(pfte[i].anchor, an, PF_ANCHOR_NAME_SIZE);
234 char an[PF_ANCHOR_NAME_SIZE]; local
244 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
246 strlcpy(pfp.anchor, an, PF_ANCHOR_NAME_SIZE);
247 strlcpy(pfr.anchor, an, PF_ANCHOR_NAME_SIZE);
|
| /src/external/bsd/unbound/dist/testcode/ |
| pktview.c | 156 uint16_t i, f, qd, an, ns, ar; local
167 an = sldns_buffer_read_u16(pkt);
168 printf("ancount: %d\n", (int)an);
178 if(rrnum == (int)qd+(int)an)
180 if(rrnum == (int)qd+(int)an+(int)ns)
|
| /src/external/lgpl3/gmp/dist/tests/mpz/ |
| t-limbs.c | 33 mp_size_t an = mpz_size (a); local
37 ASSERT (an > 0);
39 if (an < bn)
41 MP_SIZE_T_SWAP (an, bn);
44 rp = mpz_limbs_modify (r, an + 1);
45 rp[an] = mpn_add (rp, mpz_limbs_read (a), an, mpz_limbs_read (b), bn);
46 mpz_limbs_finish (r, an + 1);
100 mp_size_t an = mpz_size (a); local
107 ASSERT (an > 0)
174 mp_size_t an, bn; local
[all...] |
| /src/external/lgpl3/mpc/dist/tests/ |
| tballs.c | 32 mpcb_t a, b, an, bn, anp1, bnp1, res; local
67 mpcb_init (an);
79 mpcb_set_prec (an, prec);
91 mpc_set_ui_ui (an->c, 1, 0, MPC_RNDNN);
92 mpcr_set_zero (an->r);
101 mpcb_add (anp1, an, bn);
103 mpcb_mul (bnp1, an, bn);
107 equal = mpc_cmp (an->c, bn->c) == 0
108 || ( mpc_cmp (an->c, anp1->c) == 0
110 mpcb_set (an, anp1)
[all...] |
| /src/dist/pf/usr.sbin/ftp-proxy/ |
| filter.c | 15 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
217 char an[PF_ANCHOR_NAME_SIZE]; local
225 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
229 strlcpy(pfte[i].anchor, an, PF_ANCHOR_NAME_SIZE);
256 char an[PF_ANCHOR_NAME_SIZE]; local
266 snprintf(an, PF_ANCHOR_NAME_SIZE, "%s/%d.%d", FTP_PROXY_ANCHOR,
268 strlcpy(pfp.anchor, an, PF_ANCHOR_NAME_SIZE);
269 strlcpy(pfr.anchor, an, PF_ANCHOR_NAME_SIZE);
|
| /src/lib/libc/stdlib/ |
| radixsort.c | 156 const u_char **an, *t, **aj, **top[256]; local
170 an = a + n;
175 for (ak = a; ak < an;) {
202 top[255] = an;
231 for (aj = a; aj < an; *aj = r, aj += count[c], count[c] = 0)
|
| /src/external/bsd/jemalloc/dist/test/include/test/ |
| math.h | 46 double acu, factor, oflo, gin, term, rn, a, b, an, dif; local
92 an = a * term;
94 pn[i+4] = b * pn[i+2] - an * pn[i];
|
| /src/external/bsd/jemalloc.old/dist/test/include/test/ |
| math.h | 46 double acu, factor, oflo, gin, term, rn, a, b, an, dif; local
92 an = a * term;
94 pn[i+4] = b * pn[i+2] - an * pn[i];
|
| /src/external/lgpl3/gmp/dist/rand/ |
| randlc2x.c | 44 the size of the value in the normal way for an mpz_t, except that a value
76 mp_size_t tn, seedn, an; local
92 an = SIZ (p->_mp_a);
99 ta = an + seedn + 1;
103 mp_size_t tmp = an + seedn;
111 /* t = a * seed. NOTE: an is always > 0; see initialization. */
112 ASSERT (seedn >= an && an > 0);
113 mpn_mul (tp, seedp, seedn, ap, an);
237 /* Store p->_mp_seed as an unnormalized integer with size enoug
[all...] |
| /src/external/lgpl3/mpc/dist/src/ |
| agm.c | 80 mpc_t b0, a1, an, bn, anp1, bnp1; local
89 /* Compute an approximation k1 of the precision loss in the first
120 /* 20 is an arbitrary safety margin. */
123 an integer; then correct this when taking the logarithm. */
137 mpc_init2 (an, prec);
147 mpc_set_ui (an, 1, MPC_RNDNN);
151 the last iteration, so we may stop when an==anp1 and bn==bnp1.
153 has an==bn, which is also tested for an early abort strategy. */
156 mpc_add (anp1, an, bn, MPC_RNDNN)
[all...] |
