| /external/elfutils/0.153/libdwfl/ |
| find-debuginfo.c | 283 const unsigned char *bits; local
285 if (INTUSE(dwfl_module_build_id) (mod, &bits, &vaddr) > 0)
|
| /external/flac/libFLAC/ |
| fixed.c | 58 /* rbps stands for residual bits per sample
67 unsigned bits; /* the number of bits required to represent a number */ local
68 int fracbits; /* the number of bits of rbps that comprise the fractional part */
78 * The above two things tell us 1) n fits in 16 bits; 2) err/n > 1.
87 /* err now holds err/n with fracbits fractional bits */
90 * Whittle err down to 16 bits max. 16 significant bits is enough for
94 bits = FLAC__bitmath_ilog2(err)+1;
95 if(bits > 16)
146 unsigned bits; \/* the number of bits required to represent a number *\/ local
[all...] |
| /external/freetype/src/gzip/ |
| infblock.c | 15 #define bits word.what.Bits macro
27 3. There is an implied maximum of 7 bits for the bit length table and
28 15 bits for the actual data.
36 zero distance codes, which is sent as one code of zero bits in
41 cannot be used though, since there is no length base or extra bits
43 However, static trees define 32 codes (all 5 bits) to fill out the
47 8. The five bits following the block type is really the number of
49 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
55 11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19
[all...] |
| /external/google-tv-pairing-protocol/java/src/com/google/polo/wire/json/ |
| Base64.java | 74 int bits = 0; local
88 bits = chr - 65;
93 bits = chr - 71;
98 bits = chr + 4;
100 bits = 62;
102 bits = 63;
107 quantum = (quantum << 6) | (byte) bits;
|
| /external/guava/guava/src/com/google/common/hash/ |
| BloomFilter.java | 48 * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element.
50 <T> void put(T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
53 * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element;
54 * returns {@code true} if and only if all selected bits are set.
57 T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
61 private final BitArray bits; field in class:BloomFilter
77 private BloomFilter(BitArray bits, int numHashFunctions, Funnel<T> funnel,
80 this.bits = checkNotNull(bits);
91 return strategy.mightContain(object, funnel, numHashFunctions, bits);
[all...] |
| Murmur3_128HashFunction.java | 38 @Override public int bits() { method in class:Murmur3_128HashFunction
|
| /external/guava/guava-tests/test/com/google/common/hash/ |
| AbstractNonStreamingHashFunctionTest.java | 46 public int bits() { method in class:AbstractNonStreamingHashFunctionTest.StreamingVersion
78 public int bits() { method in class:NonStreamingVersion
|
| /external/icu/icu4c/source/i18n/ |
| decNumber.h | 41 /* Bit settings for decNumber.bits */
46 /* The remaining bits are reserved; they must be 0 */
85 uint8_t bits; /* Indicator bits (see above) */ member in struct:__anon25704
184 #define decNumberIsFinite(dn) (((dn)->bits&DECSPECIAL)==0)
185 #define decNumberIsInfinite(dn) (((dn)->bits&DECINF)!=0)
186 #define decNumberIsNaN(dn) (((dn)->bits&(DECNAN|DECSNAN))!=0)
187 #define decNumberIsNegative(dn) (((dn)->bits&DECNEG)!=0)
188 #define decNumberIsQNaN(dn) (((dn)->bits&(DECNAN))!=0)
189 #define decNumberIsSNaN(dn) (((dn)->bits&(DECSNAN))!=0
[all...] |
| /external/icu/icu4c/source/test/perf/unisetperf/draft/ |
| bitset.cpp | 86 BitSet(const UnicodeSet &set, UErrorCode &errorCode) : bits(shortBits), restSet(set.clone()) {
133 // Set bits for the start of the range.
150 bits=(int64_t *)uprv_malloc(bitHash->countKeys()*8);
152 if(bits!=NULL) {
153 bitHash->invert(bits);
155 bits=shortBits;
160 latin1Set[0]=(uint32_t)bits[0];
161 latin1Set[1]=(uint32_t)(bits[0]>>32);
162 latin1Set[2]=(uint32_t)bits[1];
163 latin1Set[3]=(uint32_t)(bits[1]>>32)
192 int64_t *bits; member in class:BitSet
[all...] |
| /external/jemalloc/include/jemalloc/internal/ |
| rtree.h | 39 rtree_t *rtree_new(unsigned bits, rtree_alloc_t *alloc, rtree_dalloc_t *dalloc);
59 /* The least significant bits of the key are ignored. */ \
65 unsigned i, lshift, height, bits; \
71 i++, lshift += bits, node = child) { \
72 bits = rtree->level2bits[i]; \
74 3)) - bits); \
86 bits = rtree->level2bits[i]; \
88 bits); \
134 unsigned i, lshift, height, bits; local
140 i++, lshift += bits, node = child)
[all...] |
| /external/libopus/celt/ |
| modes.h | 53 const unsigned char *bits; member in struct:__anon28339
74 const unsigned char *allocVectors; /**< Number of bits in each band for several rates */
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/ |
| IsoTypeWriter.java | 83 int bits = 0; local
85 bits += (language.getBytes()[i] - 0x60) << (2 - i) * 5;
87 writeUInt16(bb, bits);
|
| /external/openssl/apps/ |
| dh.c | 282 int len,l,bits; local
285 bits=BN_num_bits(dh->p);
293 printf("static unsigned char dh%d_p[]={",bits);
302 printf("static unsigned char dh%d_g[]={",bits);
310 printf("DH *get_dh%d()\n\t{\n",bits);
314 bits,bits);
316 bits,bits);
|
| /external/openssl/crypto/bn/ |
| bn_exp2.c | 122 int i,j,bits,b,bits1,bits2,ret=0,wpos1,wpos2,window1,window2,wvalue1,wvalue2; local
149 bits=(bits1 > bits2)?bits1:bits2;
244 for (b=bits-1; b>=0; b--)
255 /* consider bits b-window1+1 .. b for this window */
272 /* consider bits b-window2+1 .. b for this window */
|
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| fx_zlib_inffast.c | 46 state->bits < 8
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
85 unsigned bits; /* local strm->bits */ local
91 unsigned op; /* code bits, operation, extra bits, or *
[all...] |
| /external/qemu/distrib/zlib-1.2.8/ |
| inffast.c | 46 state->bits < 8
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
85 unsigned bits; /* local strm->bits */ local
91 unsigned op; /* code bits, operation, extra bits, or *
[all...] |
| /external/skia/src/core/ |
| SkBlitBWMaskTemplate.h | 41 const uint8_t* bits = srcMask.getAddr1(cx, cy); local
50 U8CPU mask = *bits++;
66 rite_mask &= 0xFF; // only want low-8 bits of mask
88 U8CPU mask = *bits & left_mask;
90 bits += mask_rowBytes;
99 const uint8_t* b = bits;
116 bits += mask_rowBytes;
|
| /external/skia/src/utils/ |
| SkFloatUtils.h | 57 /** Bits is a unsigned integer the same size as the floating point number. */
58 typedef typename SkTypeWithSize<sizeof(RawType) * CHAR_BIT>::UInt Bits;
60 /** # of bits in a number. */
63 /** # of fraction bits in a number. */
66 /** # of exponent bits in a number. */
70 static const Bits kSignBitMask = static_cast<Bits>(1) << (kBitCount - 1);
72 /** The mask for the fraction bits. */
73 static const Bits kFractionBitMask =
74 ~static_cast<Bits>(0) >> (kExponentBitCount + 1)
129 Bits bits; member in union:SkFloatingPoint::FloatingPointUnion
[all...] |
| SkSHA1.cpp | 62 // Get the number of bits before padding.
63 uint8_t bits[8]; local
64 encode(bits, this->byteCount << 3);
78 this->update(bits, 8);
110 /** Rotates x left n bits. */
|
| /external/skia/tests/ |
| PathUtilsTest.cpp | 17 static void fill_random_bits(int chars, char* bits){
21 bits[i] = rand.nextU();
34 static void print_bits( const char* bits, int w, int h) {
38 bool bit = get_bit(&bits[y], x)!=0;
133 char bits[ h * rowBytes ]; local
134 static char* binBmp = &bits[0];
|
| /external/smack/src/org/xbill/DNS/ |
| DNSOutput.java | 46 check(long val, int bits) {
48 max <<= bits; local
51 bits + " bit value");
|
| /external/srtp/test/ |
| lfsr.c | 293 int bits = 8; local
295 for (y=0; y < (1 << bits); y++) {
297 u32_bit_string(y,bits), weight(y), period(y));
|
| /external/valgrind/main/memcheck/tests/vbit-test/ |
| vbits.c | 17 /* Return the bits of V if they fit into 64-bit. If V has fewer than
18 64 bits, the bit pattern is zero-extended to the left. */
23 case 1: return v.bits.u32;
24 case 8: return v.bits.u8;
25 case 16: return v.bits.u16;
26 case 32: return v.bits.u32;
27 case 64: return v.bits.u64;
40 case 1: fprintf(fp, "%08x", v.bits.u32); break;
41 case 8: fprintf(fp, "%02x", v.bits.u8); break;
42 case 16: fprintf(fp, "%04x", v.bits.u16); break
162 uint64_t bits; local
226 uint64_t bits = left64(get_bits64(v)); local
489 uint64_t bits = get_bits64(v); local
[all...] |
| /external/vixl/src/a64/ |
| instructions-a64.cc | 66 // An integer is constructed from the n, imm_s and imm_r bits according to
76 // (s bits must not be all set)
78 // A pattern is constructed of size bits, where the least significant S+1
79 // bits are set. The pattern is rotated right by R, and repeated across a
87 uint64_t bits = (UINT64_C(1) << (imm_s + 1)) - 1; local
88 return RotateRight(bits, imm_r, 64);
99 uint64_t bits = (UINT64_C(1) << ((imm_s & mask) + 1)) - 1; local
101 RotateRight(bits, imm_r & mask, width),
112 // ImmFP: abcdefgh (8 bits)
113 // Single: aBbb.bbbc.defg.h000.0000.0000.0000.0000 (32 bits)
115 uint32_t bits = ImmFP(); local
130 uint32_t bits = ImmFP(); local
[all...] |
| /external/zlib/src/contrib/masmx64/ |
| inffas8664.c | 57 state->bits < 8
67 - The maximum input bits used by a length/distance pair is 15 bits for the
68 length code, 5 bits for the length extra, 15 bits for the distance code,
69 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
95 /* 88 44 */ unsigned bits; /* ebx rbx local strm->bits */
member in struct:inffast_ar
136 ar.bits = state->bits;
[all...] |
