Searched defs:bits (Results 226 - 250 of 779) sorted by relevance

1234567891011>>

/external/flac/libFLAC/
H A Dfixed.c58 /* 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 > 1
146 unsigned bits; /* the number of bits required to represent a number */ local
[all...]
/external/guava/guava/src/com/google/common/hash/
H A DBloomFilter.java48 * 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); argument
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, argument
80 this.bits = checkNotNull(bits);
91 return strategy.mightContain(object, funnel, numHashFunctions, bits);
56 mightContain( T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits) argument
[all...]
H A DHashing.java50 int bits = checkPositiveAndMakeMultipleOf32(minimumBits);
52 if (bits == 32) {
54 } else if (bits <= 128) {
58 int hashFunctionsNeeded = (bits + 127) / 128;
150 * If {@code hashCode} has enough bits, returns {@code hashCode.asLong()}, otherwise
155 return (hashCode.bits() < 64) ? UnsignedInts.toLong(hashCode.asInt()) : hashCode.asLong();
223 int bits = iterator.next().bits();
224 byte[] resultBytes = new byte[bits / 8];
249 byte[] resultBytes = new byte[iterator.next().bits() /
264 checkPositiveAndMakeMultipleOf32(int bits) argument
271 final int bits; field in class:Hashing.ConcatenatedHashFunction
293 public int bits() { method in class:Hashing.ConcatenatedHashFunction
[all...]
H A DMessageDigestHashFunction.java39 private final int bits; field in class:MessageDigestHashFunction
43 this.bits = getMessageDigest(algorithmName).getDigestLength() * 8;
46 public int bits() { method in class:MessageDigestHashFunction
47 return bits;
/external/icu/icu4c/source/test/perf/unisetperf/draft/
H A Dbitset.cpp86 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[
192 int64_t *bits; member in class:BitSet
[all...]
/external/iptables/extensions/
H A Dlibxt_connlimit.c109 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/libunwind/include/
H A Dlibunwind-hppa.h52 struct { unw_word_t bits[2]; } raw; member in struct:__anon24663::__anon24664
/external/libvorbis/lib/
H A Dfloor0.c43 long bits; member in struct:__anon24745
/external/lldb/include/lldb/Host/
H A DPredicate.h40 /// of type T. Threads can efficiently wait for bits within T to be set
134 /// Set some bits in \a m_value.
136 /// Logically set the bits \a bits in the contained \a m_value in a
139 /// @param[in] bits
140 /// The bits to set in \a m_value.
149 SetValueBits (T bits, PredicateBroadcastType broadcast_type) argument
153 printf("%s (bits = 0x%8.8x, broadcast_type = %i)\n", __FUNCTION__, bits, broadcast_type);
156 m_value |= bits;
177 ResetValueBits(T bits, PredicateBroadcastType broadcast_type) argument
216 WaitForSetValueBits(T bits, const TimeValue *abstime = NULL) argument
265 WaitForResetValueBits(T bits, const TimeValue *abstime = NULL) argument
[all...]
/external/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCInst.cpp128 // Return number of bits in the constant extended operand.
153 unsigned bits = (F >> HexagonII::ExtentBitsPos) local
157 return -1 << (bits - 1);
168 unsigned bits = (F >> HexagonII::ExtentBitsPos) local
172 return ~(-1 << (bits - 1));
174 return ~(-1 << bits);
/external/mesa3d/src/gallium/auxiliary/vl/
H A Dvl_vlc.h72 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/softpipe/
H A Dsp_tex_sample.h81 } bits; member in union:sp_sampler_key
H A Dsp_tile_cache.h58 } bits; member in union:tile_address
141 addr.bits.x = x / TILE_SIZE;
142 addr.bits.y = y / TILE_SIZE;
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dbrw_state_upload.c405 brw_update_dirty_count(struct dirty_bit_map *bit_map, int32_t bits) argument
413 if (bit_map[i].bit & bits)
419 brw_print_dirty_count(struct dirty_bit_map *bit_map, int32_t bits) argument
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/
H A DHuffman.java170 // Number of bits represented in the terminal node.
184 * @param bits length of Huffman code in bits
186 Node(int symbol, int bits) { argument
189 int b = bits & 0x07;
/external/openfst/src/extensions/ngram/
H A Dbitmap-index.cc125 void BitmapIndex::BuildIndex(const uint64 *bits, size_t size) { argument
126 bits_ = bits;
/external/openfst/src/include/fst/extensions/ngram/
H A Dbitmap-index.h28 // clear bits over ranges in constant time.
31 // size in bits that maintains a running count of the number of bits set
37 // bits set in each block is created using the type uint64.
54 static void Set(uint64* bits, size_t index) { argument
55 bits[index >> kStorageLogBitSize] |= (kOne << (index & kStorageBlockMask));
58 static void Clear(uint64* bits, size_t index) { argument
59 bits[index >> kStorageLogBitSize] &= ~(kOne << (index & kStorageBlockMask));
70 // Returns the number of one bits in the bitmap
75 // Returns the number of one bits i
[all...]
/external/openssl/apps/
H A Ddhparam.c256 BIO_printf(bio_err," numbits number of bits in to generate (default 512)\n");
462 int len,l,bits; local
465 bits=BN_num_bits(dh->p);
475 printf("DH *get_dh%d()\n\t{\n",bits);
478 printf("\tstatic unsigned char dh%d_p[]={",bits);
487 printf("\tstatic unsigned char dh%d_g[]={",bits);
498 bits,bits);
500 bits,bits);
[all...]
/external/openssl/crypto/bn/
H A Dbn_exp2.c122 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 */
H A Dbn_rand.c119 static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom) argument
125 if (bits == 0)
131 bytes=(bits+7)/8;
132 bit=(bits-1)%8;
142 /* make a random number and set the top and bottom bits */
212 int BN_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
214 return bnrand(0, rnd, bits, top, bottom);
217 int BN_pseudo_rand(BIGNUM *rnd, int bits, int top, int bottom) argument
219 return bnrand(1, rnd, bits, top, bottom);
223 int BN_bntest_rand(BIGNUM *rnd, int bits, in argument
[all...]
/external/openssl/crypto/dsa/
H A Ddsa_gen.c88 int DSA_generate_parameters_ex(DSA *ret, int bits, argument
101 return ret->meth->dsa_paramgen(ret, bits, seed_in, seed_len,
106 return FIPS_dsa_generate_parameters_ex(ret, bits,
114 size_t qbits = bits >= 2048 ? 256 : 160;
116 if (bits >= 2048)
127 return dsa_builtin_paramgen(ret, bits, qbits, evpmd,
132 int dsa_builtin_paramgen(DSA *ret, size_t bits, size_t qbits, argument
159 if (bits < 512)
160 bits = 512;
162 bits
[all...]
/external/owasp/sanitizer/src/main/org/owasp/html/
H A DCssSchema.java48 final int bits; field in class:CssSchema.Property
57 int bits, ImmutableSet<String> literals,
59 this.bits = bits;
56 Property( int bits, ImmutableSet<String> literals, ImmutableMap<String, String> fnKeys) argument
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/
H A Dfx_zlib_inftrees.c23 whose indices are 0..2^bits-1. work is a writable array of at least
27 on return points to the next available entry's address. bits is the
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
37 unsigned FAR *bits,
40 unsigned len; /* a code's length in bits */
43 unsigned root; /* number of index bits for root table */
44 unsigned curr; /* number of index bits for current table */
45 unsigned drop; /* code bits to drop for sub-table */
51 unsigned low; /* low bits fo
32 inflate_table( codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work) argument
[all...]
/external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/
H A Dcmsmd5.c51 cmsUInt32Number bits[2]; member in struct:__anon28683
166 ctx->bits[0] = 0;
167 ctx->bits[1] = 0;
179 t = ctx->bits[0];
180 if ((ctx->bits[0] = t + (len << 3)) < t)
181 ctx->bits[1]++;
183 ctx->bits[1] += len >> 29;
224 count = (ctx->bits[0] >> 3) & 0x3F;
243 ((cmsUInt32Number *) ctx->in)[14] = ctx->bits[0];
244 ((cmsUInt32Number *) ctx->in)[15] = ctx->bits[
[all...]
/external/pixman/demos/
H A Dgtk-utils.c73 pixbuf_from_argb32 (uint32_t *bits, argument
86 uint32_t *src_row = &bits[i * (stride / 4)];

Completed in 598 milliseconds

1234567891011>>