Searched refs:bits (Results 101 - 125 of 1594) sorted by relevance

1234567891011>>

/external/qemu/distrib/zlib-1.2.8/
H A Dinftrees.h14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bit member in struct:__anon29634
[all...]
/external/zlib/src/contrib/infback9/
H A Dinftree9.h14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bit member in struct:__anon34340
[all...]
/external/zlib/src/
H A Dinftrees.h14 table that indexes more bits of the code. op indicates whether
17 pointer, the low four bits of op is the number of index bits of
18 that table. For a length or distance, the low four bits of op
19 is the number of extra bits to get after the code. bits is
20 the number of bits in this code or part of the code to drop off
25 unsigned char op; /* operation, extra bits, table bits */
26 unsigned char bits; /* bit member in struct:__anon34356
[all...]
/external/chromium_org/third_party/webrtc/common_audio/signal_processing/include/
H A Dspl_inl.h87 int16_t bits; local
90 bits = 16;
92 bits = 0;
94 if (0x0000FF00 & (n >> bits)) bits += 8;
95 if (0x000000F0 & (n >> bits)) bits += 4;
96 if (0x0000000C & (n >> bits)) bits += 2;
97 if (0x00000002 & (n >> bits)) bit
[all...]
/external/webrtc/src/common_audio/signal_processing/include/
H A Dspl_inl.h82 int bits; local
85 bits = 16;
87 bits = 0;
89 if (0x0000FF00 & (n >> bits)) bits += 8;
90 if (0x000000F0 & (n >> bits)) bits += 4;
91 if (0x0000000C & (n >> bits)) bits += 2;
92 if (0x00000002 & (n >> bits)) bit
[all...]
/external/llvm/lib/Support/
H A DDisassembler.cpp48 unsigned bits; local
50 bits = 32;
52 bits = 64;
59 ud_set_mode(&ud_obj, bits);
64 << std::setw(bits/4);
/external/zopfli/src/zopfli/
H A Dtree.c34 unsigned bits, i; local
43 for (bits = 0; bits <= maxbits; bits++) {
44 bl_count[bits] = 0;
53 for (bits = 1; bits <= maxbits; bits++) {
54 code = (code + bl_count[bits-1]) << 1;
55 next_code[bits]
[all...]
/external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/
H A DBitSet.pm14 # number of bits / long
30 has 'bits' => (
46 my $bits;
48 # Construct a bitset of size one word (64 bits)
49 $bits = '0' x BITS;
51 elsif (exists $args->{bits}) {
52 $bits = $args->{bits};
55 $bits = reverse unpack('B*', pack('N', $args->{number}));
66 $bits
[all...]
/external/qemu/distrib/sdl-1.2.15/src/video/bwindow/
H A DSDL_sysmouse.cc33 /* Convert bits to padded bytes */
34 #define PADDED_BITS(bits) ((bits+7)/8)
38 char *bits; member in struct:WMcursor
65 cursor->bits = (char *)SDL_malloc(4+2*((allowed_x/8)*allowed_y));
66 if ( cursor->bits == NULL ) {
71 cursor->bits[0] = allowed_y; /* Size of the cursor */
72 cursor->bits[1] = 1; /* Bit depth of cursor */
73 cursor->bits[2] = hot_y;
74 cursor->bits[
[all...]
/external/guava/guava/src/com/google/common/hash/
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...]
/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/chromium_org/net/spdy/
H A Dhpack_output_stream.cc20 void HpackOutputStream::AppendBits(uint8 bits, size_t bit_size) { argument
23 DCHECK_EQ(bits >> bit_size, 0);
28 buffer_.append(1, bits << (8 - bit_size));
30 // Buffer does not end on a byte boundary but the given bits fit
32 *buffer_.rbegin() |= bits << (8 - new_bit_offset);
34 // Buffer does not end on a byte boundary and the given bits do
36 *buffer_.rbegin() |= bits >> (new_bit_offset - 8);
37 buffer_.append(1, bits << (16 - new_bit_offset));
43 AppendBits(prefix.bits, prefix.bit_size);
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/
H A Dsp_tex_tile_cache.c59 tc->entries[pos].addr.bits.invalid = 1;
120 tc->entries[i].addr.bits.invalid = 1;
174 tc->entries[i].addr.bits.invalid = 1;
196 tc->entries[pos].addr.bits.invalid = 1;
214 uint entry = (addr.bits.x +
215 addr.bits.y * 9 +
216 addr.bits.z * 3 +
217 addr.bits.face +
218 addr.bits.level * 7);
247 pos, tile->addr.bits
[all...]
/external/chromium_org/third_party/opus/src/celt/
H A Drate.h53 static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits) argument
60 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
64 bits--;
69 if ((int)cache[mid] >= bits)
74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
85 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
92 @param offsets Requested increase or decrease in the number of bits for
96 @return Total number of bits allocated
/external/fio/lib/
H A Dieee754.c11 uint64_t pack754(long double f, unsigned bits, unsigned expbits) argument
16 unsigned significandbits = bits - expbits - 1; // -1 for sign bit
50 return (sign << (bits - 1)) | (exp << (bits-expbits - 1)) | significand;
53 long double unpack754(uint64_t i, unsigned bits, unsigned expbits) argument
58 unsigned significandbits = bits - expbits - 1; // -1 for sign bit
81 result *= (i >> (bits - 1)) & 1 ? -1.0 : 1.0;
/external/libopus/celt/
H A Drate.h53 static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits) argument
60 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
64 bits--;
69 if ((int)cache[mid] >= bits)
74 if (bits- (lo == 0 ? -1 : (int)cache[lo]) <= (int)cache[hi]-bits)
85 cache = m->cache.bits + m->cache.index[LM*m->nbEBands+band];
92 @param offsets Requested increase or decrease in the number of bits for
96 @return Total number of bits allocated
/external/mesa3d/src/gallium/drivers/softpipe/
H A Dsp_tex_tile_cache.c59 tc->entries[pos].addr.bits.invalid = 1;
120 tc->entries[i].addr.bits.invalid = 1;
174 tc->entries[i].addr.bits.invalid = 1;
196 tc->entries[pos].addr.bits.invalid = 1;
214 uint entry = (addr.bits.x +
215 addr.bits.y * 9 +
216 addr.bits.z * 3 +
217 addr.bits.face +
218 addr.bits.level * 7);
247 pos, tile->addr.bits
[all...]
/external/pixman/test/
H A Da1-trap-test.c18 uint32_t *bits = malloc (WIDTH * HEIGHT * 4); local
22 memset (bits, 0xff, WIDTH * HEIGHT * 4);
36 PIXMAN_a8r8g8b8, WIDTH, HEIGHT, bits, WIDTH * 4);
44 assert (bits[0] == 0xffff0000);
45 assert (bits[1] == 0xffffffff);
46 assert (bits[1 * WIDTH + 0] == 0xffffffff);
47 assert (bits[1 * WIDTH + 1] == 0xffffffff);
/external/wpa_supplicant_8/hostapd/src/utils/
H A Dbitfield.c16 u8 *bits; member in struct:bitfield
28 bf->bits = (u8 *) (bf + 1);
44 bf->bits[bit / 8] |= BIT(bit % 8);
52 bf->bits[bit / 8] &= ~BIT(bit % 8);
60 return !!(bf->bits[bit / 8] & BIT(bit % 8));
80 if (bf->bits[i] != 0xff)
85 i = i * 8 + first_zero(bf->bits[i]);
/external/wpa_supplicant_8/src/utils/
H A Dbitfield.c16 u8 *bits; member in struct:bitfield
28 bf->bits = (u8 *) (bf + 1);
44 bf->bits[bit / 8] |= BIT(bit % 8);
52 bf->bits[bit / 8] &= ~BIT(bit % 8);
60 return !!(bf->bits[bit / 8] & BIT(bit % 8));
80 if (bf->bits[i] != 0xff)
85 i = i * 8 + first_zero(bf->bits[i]);
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dbitfield.c16 u8 *bits; member in struct:bitfield
28 bf->bits = (u8 *) (bf + 1);
44 bf->bits[bit / 8] |= BIT(bit % 8);
52 bf->bits[bit / 8] &= ~BIT(bit % 8);
60 return !!(bf->bits[bit / 8] & BIT(bit % 8));
80 if (bf->bits[i] != 0xff)
85 i = i * 8 + first_zero(bf->bits[i]);
/external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/
H A Dbitalloc.c27 The functions in this file relate to the allocation of available bits to
103 * lossless representation of the audio data. The preferred bitpool may be larger than the bits
104 * actually required but the only input we have are the scale factors. For example, it takes 2 bits
107 * This is not ideal because 0 requires 0 bits but we currently have no way of knowing this.
113 * @param preferredBitpool Returns the number of reserved bits
146 OI_INT bits = scale_factor[sb]; local
147 if (bits > maxBits) {
148 maxBits = bits;
150 if ((bitneeds[sb] = bits) > 1) {
151 bitcount += bits;
163 OI_INT bits = scale_factor[sb]; local
304 allocAdjustedBits(OI_UINT8 *dest, OI_INT bits, OI_INT excess) argument
[all...]
/external/chromium_org/third_party/speex/include/speex/
H A Dspeex_stereo.h71 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
72 void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits);
74 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
75 void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits);
84 int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data);
/external/speex/include/speex/
H A Dspeex_stereo.h71 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
72 void speex_encode_stereo(float *data, int frame_size, SpeexBits *bits);
74 /** Transforms a stereo frame into a mono frame and stores intensity stereo info in 'bits' */
75 void speex_encode_stereo_int(spx_int16_t *data, int frame_size, SpeexBits *bits);
84 int speex_std_stereo_request_handler(SpeexBits *bits, void *state, void *data);
/external/chromium_org/third_party/icu/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...]

Completed in 721 milliseconds

1234567891011>>