| /external/boringssl/src/crypto/bn/ |
| bn.c | 182 /* BN_num_bits_word returns the minimum number of bits needed to represent the
185 static const unsigned char bits[256] = { local
202 return (bits[(int)(l >> 56)] + 56);
204 return (bits[(int)(l >> 48)] + 48);
208 return (bits[(int)(l >> 40)] + 40);
210 return (bits[(int)(l >> 32)] + 32);
218 return (bits[(int)(l >> 24L)] + 24);
220 return (bits[(int)(l >> 16L)] + 16);
224 return (bits[(int)(l >> 8)] + 8);
226 return (bits[(int)(l)])
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| DERBitString.java | 22 * @return the correct number of pad bits for a bit string defined in
59 int bits = 1; local
63 bits++;
66 return 8 - bits;
150 * @param padBits the number of extra bits at the end of the string.
|
| /external/clang/test/Sema/ |
| cast.c | 3 typedef struct { unsigned long bits[(((1) + (64) - 1) / (64))]; } cpumask_t; member in struct:__anon6656
|
| /external/dexmaker/src/dx/java/com/android/dx/util/ |
| BitIntSet.java | 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
[all...] |
| /external/elfutils/src/libdwfl/ |
| find-debuginfo.c | 309 const unsigned char *bits; local
311 if (INTUSE(dwfl_module_build_id) (mod, &bits, &vaddr) > 0)
|
| /external/guava/guava/src/com/google/common/hash/ |
| MessageDigestHashFunction.java | 65 @Override public int bits() { method in class:MessageDigestHashFunction
|
| Murmur3_128HashFunction.java | 51 @Override public int bits() { method in class:Murmur3_128HashFunction
|
| Murmur3_32HashFunction.java | 57 @Override public int bits() { method in class:Murmur3_32HashFunction
139 // Finalization mix - force all bits of a hash block to avalanche
|
| SipHashFunction.java | 63 @Override public int bits() { method in class:SipHashFunction
|
| /external/guava/guava/src/com/google/common/math/ |
| DoubleUtils.java | 48 long bits = Double.doubleToRawLongBits(d); local
49 bits += (bits >> 63) | 1;
50 return Double.longBitsToDouble(bits);
80 long bits = Double.doubleToRawLongBits(d) & EXPONENT_MASK; local
81 return (int) (bits >>> SIGNIFICAND_BITS) - EXPONENT_BIAS;
87 long bits = doubleToRawLongBits(d); local
88 bits &= SIGNIFICAND_MASK;
90 ? bits << 1
91 : bits | IMPLICIT_BIT
95 long bits = Double.doubleToRawLongBits(mag) & ~SIGN_MASK; local
149 long bits = (long) ((exponent + EXPONENT_BIAS)) << SIGNIFICAND_BITS; local
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| BigIntegerMath.java | 109 * The maximum number of bits in a square root for which we'll precompute an explicit half power
154 int bits = LongMath.log2(startingNumber, FLOOR) + 1; local
156 int nextPowerOfTwo = 1 << (bits - 1);
163 bits++;
170 int normalizedBits = bits - tz;
233 int bits = LongMath.log2(n, RoundingMode.CEILING); local
235 int numeratorBits = bits;
241 // log2(p) >= bits - 1, because p >= n/2
243 if (numeratorBits + bits >= Long.SIZE - 1) {
251 numeratorBits = bits;
[all...] |
| /external/guava/guava-tests/test/com/google/common/hash/ |
| AbstractNonStreamingHashFunctionTest.java | 62 // the output, so the input must be at least 32 bits, since the output has to be that long
68 // the output, so the input must be at least 32 bits, since the output has to be that long
98 public int bits() { method in class:AbstractNonStreamingHashFunctionTest.StreamingVersion
130 public int bits() { method in class:NonStreamingVersion
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
| BMPSet.java | 19 * 2-byte characters: Bits organized vertically.
32 * One bit per code point from U+0000..U+07FF. The bits are organized vertically; consecutive code points
36 * Bits for 0..7F (non-shortest forms) are set to the result of contains(FFFD) for faster validity checking at
42 * One bit per 64 BMP code points. The bits are organized vertically; consecutive 64-code point blocks
44 * t1=c{11..6} test bits (lead+16) and lead in bmpBlockBits[t1]. If the upper bit is 0, then the lower bit
48 * Bits for 0..7FF (non-shortest forms) and D800..DFFF are set to the result of contains(FFFD) for faster
108 // All 64 code points with the same bits 15..6
160 // All 64 code points with the same bits 15..6
199 // All 64 code points with the same bits 15..6
256 // All 64 code points with the same bits 15..
332 int bits = 1 << lead; local
[all...] |
| /external/iptables/extensions/ |
| libxt_connlimit.c | 109 unsigned int bits = 0; local
112 ++bits;
114 return 32 - bits;
119 unsigned int bits = 0, i; local
124 ++bits;
125 return 128 - bits;
|
| /external/jemalloc/include/jemalloc/internal/ |
| rtree.h | 52 * Suppose keys comprise 48 bits, and LG_RTREE_BITS_PER_LEVEL is 4.
65 * lower 47 bits of virtual address space in userland, thus leaving
72 /* Number of key bits distinguished by this level. */
73 unsigned bits; member in struct:rtree_level_s
75 * Cumulative number of key bits distinguished by traversing to
87 * bits to which subtree level to start at.
97 bool rtree_new(rtree_t *rtree, unsigned bits, rtree_node_alloc_t *alloc,
149 rtree->levels[level].bits) - 1));
|
| /external/jmonkeyengine/engine/src/core-plugins/com/jme3/export/binary/ |
| ByteUtils.java | 307 long bits = Double.doubleToLongBits(n); local
308 return convertToBytes(bits);
337 long bits = convertLongFromBytes(bytes, offset); local
338 return Double.longBitsToDouble(bits);
|
| /external/libunwind/include/ |
| libunwind-hppa.h | 52 struct { unw_word_t bits[2]; } raw; member in struct:__anon13433::__anon13434
|
| /external/libvorbis/lib/ |
| floor0.c | 43 long bits; member in struct:__anon13672
|
| /external/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| HexagonInstPrinter.cpp | 37 unsigned bits = local
41 return -1U << (bits - 1);
51 unsigned bits = local
55 return ~(-1U << (bits - 1));
57 return ~(-1U << bits);
|
| HexagonMCInstrInfo.cpp | 43 std::bitset<16> Bits(MCI.getOperand(MCI.getNumOperands() - 2).getImm());
44 return Bits;
54 unsigned bits = (F >> HexagonII::ExtentBitsPos) & HexagonII::ExtentBitsMask; local
57 return ~(-1U << (bits - 1));
59 return ~(-1U << bits);
69 unsigned bits = (F >> HexagonII::ExtentBitsPos) & HexagonII::ExtentBitsMask; local
72 return -1U << (bits - 1);
182 std::bitset<16> Bits(GetImplicitBits(MCI));
183 return Bits.test(packetBeginIndex);
187 std::bitset<16> Bits(GetImplicitBits(MCI))
[all...] |
| /external/mesa3d/src/gallium/auxiliary/gallivm/ |
| lp_bld_const.c | 132 unsigned bits; local
155 /* FIXME: consider the fractional bits? */
156 bits = type.width / 2 - 1;
158 bits = type.width - 1;
160 return (double)-((long long)1 << bits);
170 unsigned bits; local
190 bits = type.width / 2;
192 bits = type.width;
195 bits -= 1;
197 return (double)(((unsigned long long)1 << bits) - 1)
[all...] |
| lp_bld_format_soa.c | 115 assert(format_desc->block.bits <= type.width);
149 if (stop < format_desc->block.bits) {
179 unsigned bits = type.width - stop; local
180 LLVMValueRef bits_val = lp_build_const_int_vec(gallivm, type, bits);
189 unsigned bits = type.width - format_desc->channel[chan].size; local
190 LLVMValueRef bits_val = lp_build_const_int_vec(gallivm, type, bits);
325 format_desc->block.bits <= type.width &&
343 format_desc->block.bits,
|
| /external/mesa3d/src/gallium/auxiliary/vl/ |
| vl_vlc.h | 72 unsigned i, bits = util_logbase2(dst_size); local
83 for(i=0; i<(1 << (bits - src->entry.length)); ++i)
84 dst[src->bitcode >> (16 - bits) | i] = src->entry;
118 * fill the bit buffer, so that at least 32 bits are valid
193 * number of bits still valid in bit buffer
202 * number of bits left over all inbut buffers
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_util.cpp | 278 data[(size + 31) / 32 - 1] = 0; // clear unused bits (e.g. for popCount)
376 uint32_t bits = data[i]; local
377 while (bits) {
378 int pos = ffs(bits) - 1;
379 bits &= ~(1 << pos);
|
| /external/mesa3d/src/gallium/drivers/softpipe/ |
| sp_tex_sample.h | 81 } bits; member in union:sp_sampler_key
|
