Searched refs:sizeinbase2 (Results 1 – 12 of 12) sorted by relevance
35 sizeinbase2() { function51 logM=$(sizeinbase2 "${a:0:10}")60 nbits_prime=$(sizeinbase2 $p)
42 sizeinbase2() { function58 logM=$(sizeinbase2 "${a:0:10}")109 nbits_prime=$(sizeinbase2 $p)
222 int sizeinbase2(const gen & g);223 int sizeinbase2(const vecteur & v);
533 logp=sizeinbase2(p); in basis_t()538 logp=sizeinbase2(p); in basis_t()554 logp=sizeinbase2(p); in basis_t()559 logp=sizeinbase2(p); in basis_t()564 logp=sizeinbase2(p); in basis_t()607 register unsigned char nbits=sizeinbase2(bit->p); in core_sieve()695 int nbits=mpz_sizeinbase(*isqrtN._ZINTptr,2)+sizeinbase2(absshift>shiftss?absshift:shiftss); in msieve()704 unsigned char logB=(unsigned char) (nbits-int(up_to*sizeinbase2(basis.back().p)+.5)); in msieve()734 nbits = sizeinbase2(next); in msieve()2046 unsigned ps=sizeinbase2(basis.back().p); in msieve()
1761 int logrs=sizeinbase2(rs); in operator_times()2507 int l=sizeinbase2(n); in DivQuo()5419 int logrs=sizeinbase2(rs); in fft2p5()9722 int c=sizeinbase2(*it); in mod_gcd_c()9734 int h=sizeinbase2(P)*(int(Q.size())-1)+sizeinbase2(Q)*(int(P.size())-1)+1; in mod_gcd_c()9741 h -= sizeinbase2(D); in mod_gcd_c()13462 int logrs=sizeinbase2(rs); in mod_gcd_c()14285 int logrs=sizeinbase2(n-1); in mod_gcd_c()14373 int logrs=sizeinbase2(n-1); in mod_gcd_c()14596 int logrs=sizeinbase2(rs); in mod_gcd_c()[all …]
256 int j=sizeinbase2(ii); in binary_print_INT_()
1455 if (omega.type==_INT_ && modulo.type==_INT_ && n==(1<<(sizeinbase2(n)-1))){ in fft()1522 if (n==(1<<(sizeinbase2(n)-1))){ in fft()1574 if (n==(1<<(sizeinbase2(n)-1))){ in fft()1620 if (n==(1<<(sizeinbase2(n)-1))){ in fft()
77 inline unsigned sizeinbase2(U n){ in sizeinbase2() function85 unsigned i=sizeinbase2(n); in nextpow2()2834 int j=sizeinbase2(vars[i])-1;
120 return sizeinbase2(g.val>0?g.val:-g.val); in nbits()4165 if (2*(sizeinbase2(n1)-1)+sizeinbase2(p)<32) in strassen_mod()5140 int nbits=sizeinbase2(p); in int_multilinear_combination()6133 int nbits=sizeinbase2(modulo); in modlinear_combination()6345 int s=sizeinbase2(modulo); in fracmod()6352 if (2*sizeinbase2(g)<s){ in fracmod()9941 int nbits=sizeinbase2(p); in multmatvecteur_int()13204 int nbits=sizeinbase2(modulo); in mod_pcar()
4031 if (m.type==_ZINT && sizeinbase2(m)<61){ in _resultant()4034 int l=sizeinbase2(n); in _resultant()
5360 int nbits=sizeinbase2(env); in reducef4buchberger()5995 int nbits=sizeinbase2(env); in reducef4buchbergersplit()6398 int nbits=sizeinbase2(env); in reducef4buchbergersplit()6835 int nbits=sizeinbase2(env); in reducef4buchbergersplitu()6944 int nbits=sizeinbase2(env); in reducef4buchbergersplits()
1909 if (absint(sizeinbase2(n)-sizeinbase2(d))>=53){ in evalf_FRAC()