Home
last modified time | relevance | path

Searched refs:an (Results 1 – 25 of 4346) sorted by relevance

12345678910>>...174

/netbsd-src/external/lgpl3/gmp/dist/mpn/generic/
H A Ddivis.c60 mpn_divisible_p (mp_srcptr ap, mp_size_t an, in mpn_divisible_p() argument
70 ASSERT (an >= 0); in mpn_divisible_p()
71 ASSERT (an == 0 || ap[an-1] != 0); in mpn_divisible_p()
74 ASSERT_MPN (ap, an); in mpn_divisible_p()
79 if (an < dn) in mpn_divisible_p()
80 return (an == 0); in mpn_divisible_p()
95 an--; ASSERT (an >= 1); in mpn_divisible_p()
108 if (ABOVE_THRESHOLD (an, BMOD_1_TO_MOD_1_THRESHOLD)) in mpn_divisible_p()
109 return mpn_mod_1 (ap, an, dlow) == 0; in mpn_divisible_p()
113 return mpn_modexact_1_odd (ap, an, dlow) == 0; in mpn_divisible_p()
[all …]
H A Dgcd_subdiv_step.c80 mp_size_t an, bn, qn; in mpn_gcd_subdiv_step() local
87 an = bn = n; in mpn_gcd_subdiv_step()
88 MPN_NORMALIZE (ap, an); in mpn_gcd_subdiv_step()
95 if (an == bn) in mpn_gcd_subdiv_step()
98 MPN_CMP (c, ap, bp, an); in mpn_gcd_subdiv_step()
104 hook (ctx, ap, an, NULL, 0, -1); in mpn_gcd_subdiv_step()
115 if (an > bn) in mpn_gcd_subdiv_step()
117 MPN_PTR_SWAP (ap, an, bp, bn); in mpn_gcd_subdiv_step()
121 if (an <= s) in mpn_gcd_subdiv_step()
128 ASSERT_NOCARRY (mpn_sub (bp, bp, bn, ap, an)); in mpn_gcd_subdiv_step()
[all …]
H A Dsqrmod_bnm1.c96 mpn_sqrmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an, mp_ptr tp) in mpn_sqrmod_bnm1() argument
98 ASSERT (0 < an); in mpn_sqrmod_bnm1()
99 ASSERT (an <= rn); in mpn_sqrmod_bnm1()
103 if (UNLIKELY (an < rn)) in mpn_sqrmod_bnm1()
105 if (UNLIKELY (2*an <= rn)) in mpn_sqrmod_bnm1()
107 mpn_sqr (rp, ap, an); in mpn_sqrmod_bnm1()
112 mpn_sqr (tp, ap, an); in mpn_sqrmod_bnm1()
113 cy = mpn_add (rp, tp, rn, tp + rn, 2*an - rn); in mpn_sqrmod_bnm1()
128 ASSERT (2*an > n); in mpn_sqrmod_bnm1()
149 if (LIKELY (an > n)) in mpn_sqrmod_bnm1()
[all …]
H A Dmulmod_bnm1.c100 mpn_mulmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an, mp_srcptr bp, mp_size_t bn, m… in mpn_mulmod_bnm1() argument
103 ASSERT (bn <= an); in mpn_mulmod_bnm1()
104 ASSERT (an <= rn); in mpn_mulmod_bnm1()
110 if (UNLIKELY (an + bn <= rn)) in mpn_mulmod_bnm1()
112 mpn_mul (rp, ap, an, bp, bn); in mpn_mulmod_bnm1()
117 mpn_mul (tp, ap, an, bp, bn); in mpn_mulmod_bnm1()
118 cy = mpn_add (rp, tp, rn, tp + rn, an + bn - rn); in mpn_mulmod_bnm1()
139 ASSERT (an + bn > n); in mpn_mulmod_bnm1()
166 if (LIKELY (an > n)) in mpn_mulmod_bnm1()
169 cy = mpn_add (xp, a0, n, a1, an - n); in mpn_mulmod_bnm1()
[all …]
H A Dmulmid.c46 mp_srcptr ap, mp_size_t an, in mpn_mulmid() argument
52 ASSERT (an >= bn); in mpn_mulmid()
54 ASSERT (! MPN_OVERLAP_P (rp, an - bn + 3, ap, an)); in mpn_mulmid()
55 ASSERT (! MPN_OVERLAP_P (rp, an - bn + 3, bp, bn)); in mpn_mulmid()
61 if (an < CHUNK) in mpn_mulmid()
64 mpn_mulmid_basecase (rp, ap, an, bp, bn); in mpn_mulmid()
81 an -= k; in mpn_mulmid()
83 while (an >= CHUNK) in mpn_mulmid()
91 an -= k; in mpn_mulmid()
94 if (an >= bn) in mpn_mulmid()
[all …]
H A Dnussbaumer_mul.c44 mp_srcptr ap, mp_size_t an, in mpn_nussbaumer_mul() argument
51 ASSERT (an >= bn); in mpn_nussbaumer_mul()
56 if ((ap == bp) && (an == bn)) in mpn_nussbaumer_mul()
58 rn = mpn_sqrmod_bnm1_next_size (2*an); in mpn_nussbaumer_mul()
59 tp = TMP_ALLOC_LIMBS (mpn_sqrmod_bnm1_itch (rn, an)); in mpn_nussbaumer_mul()
60 mpn_sqrmod_bnm1 (pp, rn, ap, an, tp); in mpn_nussbaumer_mul()
64 rn = mpn_mulmod_bnm1_next_size (an + bn); in mpn_nussbaumer_mul()
65 tp = TMP_ALLOC_LIMBS (mpn_mulmod_bnm1_itch (rn, an, bn)); in mpn_nussbaumer_mul()
66 mpn_mulmod_bnm1 (pp, rn, ap, an, bp, bn, tp); in mpn_nussbaumer_mul()
H A Dhgcd_reduce.c42 mp_srcptr ap, mp_size_t an, mp_srcptr bp, mp_size_t bn) in submul() argument
48 ASSERT (an >= bn); in submul()
49 ASSERT (rn >= an); in submul()
50 ASSERT (an + bn <= rn + 1); in submul()
53 tp = TMP_ALLOC_LIMBS (an + bn); in submul()
55 mpn_mul (tp, ap, an, bp, bn); in submul()
56 ASSERT ((an + bn <= rn) || (tp[rn] == 0)); in submul()
57 ASSERT_NOCARRY (mpn_sub (rp, rp, rn, tp, an + bn - (an + bn > rn))); in submul()
60 while (rn > an && (rp[rn-1] == 0)) in submul()
77 mp_size_t an, bn, un, vn, nn; in hgcd_matrix_apply() local
[all …]
H A Dtoom8h_mul.c117 mp_srcptr ap, mp_size_t an, in mpn_toom8h_mul() argument
126 ASSERT (an >= bn); in mpn_toom8h_mul()
130 ASSERT (an <= bn*4); in mpn_toom8h_mul()
131 ASSERT (GMP_NUMB_BITS > 11*3 || an*4 <= bn*11); in mpn_toom8h_mul()
132 ASSERT (GMP_NUMB_BITS > 10*3 || an*1 <= bn* 2); in mpn_toom8h_mul()
133 ASSERT (GMP_NUMB_BITS > 9*3 || an*2 <= bn* 3); in mpn_toom8h_mul()
140 …if (LIKELY (an == bn) || an * (LIMIT_denominat>>1) < LIMIT_numerator * (bn>>1) ) /* is 8*... < 8*.… in mpn_toom8h_mul()
143 n = 1 + ((an - 1)>>3); in mpn_toom8h_mul()
145 s = an - 7 * n; in mpn_toom8h_mul()
150 if (an * 13 < 16 * bn) /* (an*7*LIMIT_numerator<LIMIT_denominat*9*bn) */ in mpn_toom8h_mul()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/tests/mpn/
H A Dt-mulmod_bnm1.c52 ref_mulmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an, mp_srcptr bp, mp_size_t bn) in ref_mulmod_bnm1() argument
56 ASSERT (0 < an && an <= rn); in ref_mulmod_bnm1()
59 if (an >= bn) in ref_mulmod_bnm1()
60 refmpn_mul (rp, ap, an, bp, bn); in ref_mulmod_bnm1()
62 refmpn_mul (rp, bp, bn, ap, an); in ref_mulmod_bnm1()
63 an += bn; in ref_mulmod_bnm1()
64 if (an > rn) { in ref_mulmod_bnm1()
65 cy = mpn_add (rp, rp, rn, rp + rn, an - rn); in ref_mulmod_bnm1()
105 mp_size_t an,bn,rn,n; in main() local
123 an = ((n+1) >> 1) + gmp_urandomm_ui (rands, (n+1) >> 1); in main()
[all …]
H A Dt-sqrmod_bnm1.c52 ref_sqrmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an) in ref_sqrmod_bnm1() argument
56 ASSERT (0 < an && an <= rn); in ref_sqrmod_bnm1()
58 refmpn_mul (rp, ap, an, ap, an); in ref_sqrmod_bnm1()
59 an *= 2; in ref_sqrmod_bnm1()
60 if (an > rn) { in ref_sqrmod_bnm1()
61 cy = mpn_add (rp, rp, rn, rp + rn, an - rn); in ref_sqrmod_bnm1()
100 mp_size_t an,rn,n; in main() local
116 an = 1; in main()
118 an = ((n+1) >> 1) + gmp_urandomm_ui (rands, (n+1) >> 1); in main()
120 mpn_random2 (ap, an); in main()
[all …]
H A Dtoom-shared.h43 #define MAX_BN(an) (an) argument
80 mp_size_t an, bn; in main() local
91 an = MIN_AN in main()
93 bn = MIN_BN(an) in main()
94 + gmp_urandomm_ui (rands, MAX_BN(an) + 1 - MIN_BN(an)); in main()
96 mpn_random2 (ap, an); in main()
98 mpn_random2 (pp-1, an + bn + 2); in main()
100 p_after = pp[an + bn]; in main()
102 itch = mpn_toomMN_mul_itch (an, bn); in main()
108 mpn_toomMN_mul (pp, ap, an, bp, bn, scratch); in main()
[all …]
H A Dtoom-sqr-shared.h59 mp_size_t an; in main() local
63 an = MIN_AN in main()
66 mpn_random2 (ap, an); in main()
67 mpn_random2 (pp-1, an * 2 + 2); in main()
69 p_after = pp[an * 2]; in main()
71 itch = mpn_toomN_sqr_itch (an); in main()
77 mpn_toomN_sqr (pp, ap, an, scratch); in main()
78 refmpn_mul (refp, ap, an, ap, an); in main()
79 if (pp[-1] != p_before || pp[an * 2] != p_after in main()
81 || mpn_cmp (refp, pp, an * 2) != 0) in main()
[all …]
H A Dt-mul.c53 mp_size_t max_n, an, bn, rn; in main() local
71 for (an = 1; an <= max_n; an += 1) in main()
73 for (bn = 1; bn <= an; bn += 1) in main()
75 mpn_random2 (ap, an + 1); in main()
78 refmpn_mul (refp, ap, an, bp, bn); in main()
79 mpn_mul (rp, ap, an, bp, bn); in main()
81 rn = an + bn; in main()
85 (int) an, (int) bn, (int) rn); in main()
86 printf ("a: "); mpn_dump (ap, an); in main()
H A Dt-mulmid.c57 mp_size_t an, bn, rn; in main() local
61 an = 1 + gmp_urandomm_ui(rands, 1L << size_log); in main()
67 if (an < bn) in main()
68 MP_SIZE_T_SWAP (an, bn); in main()
70 mpn_random2 (ap, an); in main()
73 refmpn_mulmid (refp, ap, an, bp, bn); in main()
74 mpn_mulmid (rp, ap, an, bp, bn); in main()
76 rn = an + 3 - bn; in main()
80 test, (int) an, (int) bn, (int) rn); in main()
81 printf("a: "); mpn_dump (ap, an); in main()
H A Dt-matrix22.c81 #define MUL(rp, ap, an, bp, bn) do { \ argument
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; in ref_matrix22_mul() local
102 an = A->n, bn = B->n; in ref_matrix22_mul()
111 an = B->n, bn = A->n; in ref_matrix22_mul()
113 n = an + bn; in ref_matrix22_mul()
116 mpn_mul (r00, a00, an, b00, bn); in ref_matrix22_mul()
117 mpn_mul (tp, a01, an, b10, bn); in ref_matrix22_mul()
[all …]
/netbsd-src/games/primes/
H A Dspsp.c54 uint64_t an = a % n; in mulmod() local
58 x += an; in mulmod()
59 if ((x < an) || (x >= n)) in mulmod()
62 if (an + an < an) in mulmod()
63 an = an + an - n; in mulmod()
64 else if (an + an >= n) in mulmod()
65 an = an + an - n; in mulmod()
67 an = an + an; in mulmod()
/netbsd-src/external/lgpl3/mpfr/dist/src/
H A Dsub1.c37 mp_size_t cancel2, an, bn, cn, cn0; in mpfr_sub1() local
49 an = MPFR_LIMB_SIZE(a); in mpfr_sub1()
198 sh = (mpfr_prec_t) an * GMP_NUMB_BITS - aq; in mpfr_sub1()
199 mpn_sub_1 (ap, ap, an, MPFR_LIMB_ONE << sh); in mpfr_sub1()
200 if (MPFR_UNLIKELY (MPFR_LIMB_MSB (ap[an-1]) == 0)) in mpfr_sub1()
204 ap[an-1] |= MPFR_LIMB_HIGHBIT; in mpfr_sub1()
333 if (MPFR_LIKELY(an + (mp_size_t) cancel1 <= bn)) in mpfr_sub1()
336 MPN_COPY (ap, bp + bn - (an + cancel1), an); in mpfr_sub1()
342 MPN_ZERO (ap, an + cancel1 - bn); in mpfr_sub1()
343 MPN_COPY (ap + (an + cancel1 - bn), bp, bn - cancel1); in mpfr_sub1()
[all …]
H A Dadd1.c33 mp_size_t an, bn, cn; in mpfr_add1() local
59 an = MPFR_PREC2LIMBS (aq); /* number of limbs of a */ in mpfr_add1()
60 aq2 = (mpfr_prec_t) an * GMP_NUMB_BITS; in mpfr_add1()
118 if (MPFR_UNLIKELY(an > bn)) in mpfr_add1()
121 MPN_COPY(ap + (an - bn), bp, bn); in mpfr_add1()
123 MPN_ZERO(ap, an - bn); in mpfr_add1()
128 MPN_COPY(ap, bp + (bn - an), an); in mpfr_add1()
150 MPFR_ASSERTD(difn - cn <= an); in mpfr_add1()
157 a2p = ap + (an - k); in mpfr_add1()
173 cc = an > bn in mpfr_add1()
[all …]
H A Drec_sqrt.c162 mp_size_t an = LIMB_SIZE(ap); /* number of limbs of A */ in mpfr_mpn_rec_sqrt() local
165 MPFR_ASSERTD((a[an - 1] & MPFR_LIMB_HIGHBIT) != 0); in mpfr_mpn_rec_sqrt()
170 MPFR_ASSERTD((a + an <= x) || (x + n <= a)); in mpfr_mpn_rec_sqrt()
173 if (MPFR_UNLIKELY(an > n)) /* we can cut the input to n limbs */ in mpfr_mpn_rec_sqrt()
175 a += an - n; in mpfr_mpn_rec_sqrt()
176 an = n; in mpfr_mpn_rec_sqrt()
186 i = a[an - 1] >> (GMP_NUMB_BITS - (12 + as)); in mpfr_mpn_rec_sqrt()
190 unsigned int a12 = a[an - 1] << 8; in mpfr_mpn_rec_sqrt()
191 if (an >= 2) in mpfr_mpn_rec_sqrt()
192 a12 |= a[an - 2]; in mpfr_mpn_rec_sqrt()
[all …]
/netbsd-src/external/lgpl3/gmp/dist/tests/mpz/
H A Dt-limbs.c33 mp_size_t an = mpz_size (a); in alt_add() local
37 ASSERT (an > 0); in alt_add()
39 if (an < bn) in alt_add()
41 MP_SIZE_T_SWAP (an, bn); in alt_add()
44 rp = mpz_limbs_modify (r, an + 1); in alt_add()
45 rp[an] = mpn_add (rp, mpz_limbs_read (a), an, mpz_limbs_read (b), bn); in alt_add()
46 mpz_limbs_finish (r, an + 1); in alt_add()
100 mp_size_t an = mpz_size (a); in alt_mul() local
107 ASSERT (an > 0); in alt_mul()
109 if (an < bn) in alt_mul()
[all …]
/netbsd-src/external/lgpl3/mpc/dist/src/
H A Dagm.c80 mpc_t b0, a1, an, bn, anp1, bnp1; in mpc_agm_general() local
137 mpc_init2 (an, prec); in mpc_agm_general()
147 mpc_set_ui (an, 1, MPC_RNDNN); in mpc_agm_general()
156 mpc_add (anp1, an, bn, MPC_RNDNN); in mpc_agm_general()
158 mpc_mul (bnp1, an, bn, MPC_RNDNN); in mpc_agm_general()
160 equal = (mpc_cmp (an, anp1) == 0 && mpc_cmp (bn, bnp1) == 0) in mpc_agm_general()
162 mpc_swap (an, anp1); in mpc_agm_general()
168 mpc_mul (an, an, a, MPC_RNDNN); in mpc_agm_general()
170 mpc_mul (an, an, b, MPC_RNDNN); in mpc_agm_general()
172 exp_diff = mpfr_get_exp (mpc_imagref (an)) in mpc_agm_general()
[all …]
/netbsd-src/external/lgpl3/mpc/dist/tests/
H A Dtballs.c32 mpcb_t a, b, an, bn, anp1, bnp1, res; in mpc_mpcb_agm() local
67 mpcb_init (an); in mpc_mpcb_agm()
79 mpcb_set_prec (an, prec); in mpc_mpcb_agm()
91 mpc_set_ui_ui (an->c, 1, 0, MPC_RNDNN); in mpc_mpcb_agm()
92 mpcr_set_zero (an->r); in mpc_mpcb_agm()
101 mpcb_add (anp1, an, bn); in mpc_mpcb_agm()
103 mpcb_mul (bnp1, an, bn); in mpc_mpcb_agm()
107 equal = mpc_cmp (an->c, bn->c) == 0 in mpc_mpcb_agm()
108 || ( mpc_cmp (an->c, anp1->c) == 0 in mpc_mpcb_agm()
110 mpcb_set (an, anp1); in mpc_mpcb_agm()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/jit/docs/topics/
H A Dexpressions.rst27 A :c:type:`gcc_jit_rvalue *` is an expression that can be computed.
31 * an integer value e.g. `0` or `42`
42 Every rvalue has an associated type, and the API will check to ensure
43 that types match up correctly (otherwise the context will emit an error).
51 Upcast the given rvalue to be an object.
62 Given a numeric type (integer or floating point), build an rvalue for
70 Given a numeric type (integer or floating point), build an rvalue for
98 Given a numeric type (integer or floating point), build an rvalue for
106 Given a pointer type, build an rvalue for the given address.
111 Given a pointer type, build an rvalue for ``NULL``. Essentially this
[all …]
/netbsd-src/external/gpl3/gdb.old/dist/libiberty/
H A Dsimple-object.txh6 Opens an object file for reading. Creates and returns an
13 normal case, but may be a different value when reading an object file
14 in an archive file.
21 If an error occurs, this functions returns @code{NULL} and sets
22 @code{*@var{errmsg}} to an error string and sets @code{*@var{err}} to
23 an errno value or @code{0} if there is no relevant errno.
44 returns an error string, and sets @code{*@var{err}} to an errno value
66 If an error occurs, @code{simple_object_find_section} returns
67 @code{0}, sets @code{*@var{errmsg}} to an error message, and sets
68 @code{*@var{err}} to an errno value or @code{0} if there is no
[all …]
/netbsd-src/external/gpl3/gdb/dist/libiberty/
H A Dsimple-object.txh6 Opens an object file for reading. Creates and returns an
13 normal case, but may be a different value when reading an object file
14 in an archive file.
21 If an error occurs, this functions returns @code{NULL} and sets
22 @code{*@var{errmsg}} to an error string and sets @code{*@var{err}} to
23 an errno value or @code{0} if there is no relevant errno.
44 returns an error string, and sets @code{*@var{err}} to an errno value
66 If an error occurs, @code{simple_object_find_section} returns
67 @code{0}, sets @code{*@var{errmsg}} to an error message, and sets
68 @code{*@var{err}} to an errno value or @code{0} if there is no
[all …]

12345678910>>...174