| /prebuilts/go/darwin-x86/src/crypto/dsa/ |
| dsa_test.go | 36 if params.P.BitLen() != L {
37 t.Errorf("%d: params.BitLen got:%d want:%d", int(sizes), params.P.BitLen(), L)
40 if params.Q.BitLen() != N {
41 t.Errorf("%d: q.BitLen got:%d want:%d", int(sizes), params.Q.BitLen(), L)
|
| dsa.go | 116 if p.BitLen() < L {
157 xBytes := make([]byte, priv.Q.BitLen()/8)
197 n := priv.Q.BitLen()
261 n := pub.Q.BitLen()
|
| /prebuilts/go/linux-x86/src/crypto/dsa/ |
| dsa_test.go | 36 if params.P.BitLen() != L {
37 t.Errorf("%d: params.BitLen got:%d want:%d", int(sizes), params.P.BitLen(), L)
40 if params.Q.BitLen() != N {
41 t.Errorf("%d: q.BitLen got:%d want:%d", int(sizes), params.Q.BitLen(), L)
|
| dsa.go | 116 if p.BitLen() < L {
157 xBytes := make([]byte, priv.Q.BitLen()/8)
197 n := priv.Q.BitLen()
261 n := pub.Q.BitLen()
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| arith_amd64p32.s | 42 TEXT ·bitLen(SB),NOSPLIT,$0
|
| arith_decl.go | 21 func bitLen(x Word) (n int)
|
| arith_decl_pure.go | 53 func bitLen(x Word) (n int) {
|
| arith_ppc64x.s | 45 TEXT ·bitLen(SB),NOSPLIT,$0
|
| /prebuilts/go/linux-x86/src/math/big/ |
| arith_amd64p32.s | 42 TEXT ·bitLen(SB),NOSPLIT,$0
|
| arith_decl.go | 21 func bitLen(x Word) (n int)
|
| arith_decl_pure.go | 53 func bitLen(x Word) (n int) {
|
| arith_ppc64x.s | 45 TEXT ·bitLen(SB),NOSPLIT,$0
|
| /external/iproute2/ip/ |
| tcp_metrics.c | 159 if (f.daddr.family && f.daddr.bitlen >= 0 &&
160 inet_addr_match(&daddr, &f.daddr, f.daddr.bitlen))
165 if (slen && f.saddr.family && f.saddr.bitlen >= 0 &&
166 inet_addr_match(&saddr, &f.saddr, f.saddr.bitlen))
317 f.daddr.bitlen = -1;
319 f.saddr.bitlen = -1;
339 if (f.saddr.bitlen >= 0)
343 if (f.saddr.bytelen && f.saddr.bytelen * 8 == f.saddr.bitlen) {
364 if (f.daddr.bitlen >= 0)
368 if (f.daddr.bytelen && f.daddr.bytelen * 8 == f.daddr.bitlen) {
[all...] |
| ipmroute.c | 100 if (tb[RTA_DST] && filter.mdst.bitlen > 0) {
106 if (inet_addr_match(&dst, &filter.mdst, filter.mdst.bitlen))
110 if (tb[RTA_SRC] && filter.msrc.bitlen > 0) {
116 if (inet_addr_match(&src, &filter.msrc, filter.msrc.bitlen))
191 filter.mdst.bitlen = -1;
192 filter.msrc.bitlen = -1;
|
| /prebuilts/go/darwin-x86/src/crypto/rand/ |
| util_test.go | 20 if p.BitLen() != n {
37 // start at 128 so the case of (max.BitLen() % 8) == 0 is covered
|
| util.go | 97 // the number to be one bit too long. Thus we check BitLen
99 if p.ProbablyPrime(20) && p.BitLen() == bits {
110 k := (max.BitLen() + 7) / 8
113 b := uint(max.BitLen() % 8)
|
| /prebuilts/go/linux-x86/src/crypto/rand/ |
| util_test.go | 20 if p.BitLen() != n {
37 // start at 128 so the case of (max.BitLen() % 8) == 0 is covered
|
| util.go | 97 // the number to be one bit too long. Thus we check BitLen
99 if p.ProbablyPrime(20) && p.BitLen() == bits {
110 k := (max.BitLen() + 7) / 8
113 b := uint(max.BitLen() % 8)
|
| /external/zopfli/src/zopflipng/lodepng/ |
| lodepng_util.cpp | 310 int makeFromLengths(const std::vector<unsigned long>& bitlen, unsigned long maxbitlen)
312 unsigned long numcodes = (unsigned long)(bitlen.size()), treepos = 0, nodefilled = 0;
315 for(unsigned long bits = 0; bits < numcodes; bits++) blcount[bitlen[bits]]++;
321 for(unsigned long n = 0; n < numcodes; n++) if(bitlen[n] != 0) tree1d[n] = nextcode[bitlen[n]]++;
324 for(unsigned long i = 0; i < bitlen[n]; i++) //the bits for this code
326 unsigned long bit = (tree1d[n] >> (bitlen[n] - i - 1)) & 1;
330 if(i + 1 == bitlen[n])
385 std::vector<unsigned long> bitlen(288, 8), bitlenD(32, 5);;
386 for(size_t i = 144; i <= 255; i++) bitlen[i] = 9
[all...] |
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| arith_decl.go | 54 func bitLen(x Word) (n int) {
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/ |
| arith_decl.go | 51 func bitLen(x Word) (n int) {
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| arith_decl.go | 54 func bitLen(x Word) (n int) {
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/big/ |
| arith_decl.go | 51 func bitLen(x Word) (n int) {
|
| /external/tcpdump/ |
| print-domain.c | 64 int bitlen, bytelen; local
70 if ((bitlen = *cp++) == 0)
71 bitlen = 256;
72 bytelen = (bitlen + 7) / 8;
88 int bitlen, slen, b; local
94 if ((bitlen = *cp) == 0)
95 bitlen = 256;
96 slen = (bitlen + 3) / 4;
101 for (bitp = cp + 1, b = bitlen; bitp < lim && b > 7; b -= 8, bitp++) {
114 ND_PRINT((ndo, "/%d]", bitlen));
131 int bitlen, elt; local
[all...] |
| /external/pdfium/third_party/bigint/ |
| BigUnsignedInABase.cc | 25 unsigned int bitLen(unsigned int x) {
46 int minBitsPerDigit = bitLen(base) - 1;
|
