| /external/qemu/distrib/sdl-1.2.15/src/video/bwindow/ |
| SDL_sysmouse.cc | 33 /* 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[3] = hot_x
[all...] |
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 50 int bits = checkPositiveAndMakeMultipleOf32(minimumBits); local
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(); local
224 byte[] resultBytes = new byte[bits / 8];
249 byte[] resultBytes = new byte[iterator.next().bits() / 8]
271 final int bits; field in class:Hashing.ConcatenatedHashFunction
293 public int bits() { method in class:Hashing.ConcatenatedHashFunction
[all...] |
| /external/lldb/include/lldb/Host/ |
| Predicate.h | 40 /// 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)
153 printf("%s (bits = 0x%8.8x, broadcast_type = %i)\n", __FUNCTION__, bits, broadcast_type);
156 m_value |= bits;
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| s_nan.c | 42 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
54 int bitpos; /* index into words (in bits) */
66 /* Scan backwards, filling in the bits in words[] as we go. */
83 uint32_t bits[2]; member in union:__anon1073
86 _scan_nan(u.bits, 2, s);
88 u.bits[1] |= 0x7ff80000;
90 u.bits[0] |= 0x7ff80000;
100 uint32_t bits[1]; member in union:__anon1074
103 _scan_nan(u.bits, 1, s);
104 u.bits[0] |= 0x7fc00000
[all...] |
| /external/chromium_org/net/spdy/ |
| hpack_output_stream.cc | 20 void HpackOutputStream::AppendBits(uint8 bits, size_t bit_size) {
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/ |
| sp_tex_tile_cache.c | 59 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.x, tile->addr.bits.y, tile->z, tile->face, tile->level)
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| rate.h | 53 static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits)
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/ |
| ieee754.c | 11 uint64_t pack754(long double f, unsigned bits, unsigned expbits)
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)
58 unsigned significandbits = bits - expbits - 1; // -1 for sign bit
81 result *= (i >> (bits - 1)) & 1 ? -1.0 : 1.0;
|
| /external/libopus/celt/ |
| rate.h | 53 static OPUS_INLINE int bits2pulses(const CELTMode *m, int band, int LM, int bits)
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/ |
| sp_tex_tile_cache.c | 59 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.x, tile->addr.bits.y, tile->z, tile->face, tile->level)
[all...] |
| /external/pixman/test/ |
| a1-trap-test.c | 18 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/src/utils/ |
| bitfield.c | 16 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]);
|
| /ndk/sources/android/support/src/msun/ |
| s_nan.c | 58 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
70 int bitpos; /* index into words (in bits) */
82 /* Scan backwards, filling in the bits in words[] as we go. */
99 uint32_t bits[2]; member in union:__anon42812
102 _scan_nan(u.bits, 2, s);
104 u.bits[1] |= 0x7ff80000;
106 u.bits[0] |= 0x7ff80000;
116 uint32_t bits[1]; member in union:__anon42813
119 _scan_nan(u.bits, 1, s);
120 u.bits[0] |= 0x7fc00000
[all...] |
| /external/speex/include/speex/ |
| speex_stereo.h | 71 /** 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);
|
| /frameworks/av/media/libstagefright/codecs/amrnb/common/src/ |
| bits2prm.cpp | 83 no_of_bits = number of bits associated with value
84 bitstream = pointer to buffer where bits are read
102 Purpose : Read "no_of_bits" bits from the array bitstream[]
119 Word16 no_of_bits, // input : number of bits associated with value
120 Word16 *bitstream // output: address where bits are written
163 Word16 no_of_bits, /* input : number of bits associated with value */
164 Word16 *bitstream /* input: address where bits are read from */
190 bits[] = pointer to serial bits of type Word16
210 the received serial bits in a frame
[all...] |
| /frameworks/av/media/libstagefright/codecs/amrnb/enc/src/ |
| prm2bits.cpp | 92 no_of_bits = number of bits associated with value of type Word16
95 bitstream = pointer to address where bits are written of type Word16
111 PURPOSE: convert integer to binary and write the bits to the array
112 bitstream[]. The most significant bits are written first.
129 Word16 no_of_bits, // input : number of bits associated with value
130 Word16 *bitstream // output: address where bits are written
180 Word16 no_of_bits, /* input : number of bits associated with value */
181 Word16 *bitstream /* output: address where bits are written */
209 bits[] = pointer to serial bits of type Word1
[all...] |
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| pvmp3_crc.cpp | 45 int32 neededBits, number of bits to read from the bit stream
124 int32 neededBits, /* number of bits to read from the bit stream */
128 uint32 bits = getNbits(inputStream, neededBits); local
132 calculate_crc(bits, neededBits, crc);
134 return(bits);
|
| /libcore/luni/src/main/native/ |
| java_lang_Double.cpp | 28 uint64_t bits; member in union:Double
35 return d.bits;
40 d.bits = val;
|
| java_lang_Float.cpp | 28 unsigned int bits; member in union:Float
35 return f.bits;
40 f.bits = val;
|
| /ndk/sources/android/support/src/stdio/arm/ |
| _fpmath.h | 54 } bits; member in union:IEEEl2bits
65 (a)[0] = (uint32_t)(u).bits.manl; \
66 (a)[1] = (uint32_t)(u).bits.manh; \
|
| /external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/ |
| bitalloc.c | 27 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
[all...] |
| /bionic/libc/bionic/ |
| fpclassify.cpp | 40 ieee_single bits; member in union:float_u
45 ieee_double bits; member in union:double_u
51 if (u.bits.dbl_exp == 0) {
52 return ((u.bits.dbl_fracl | u.bits.dbl_frach) == 0) ? FP_ZERO : FP_SUBNORMAL;
54 if (u.bits.dbl_exp == DBL_EXP_INFNAN) {
55 return ((u.bits.dbl_fracl | u.bits.dbl_frach) == 0) ? FP_INFINITE : FP_NAN;
64 if (u.bits.sng_exp == 0) {
65 return (u.bits.sng_frac == 0) ? FP_ZERO : FP_SUBNORMAL
121 ieee_ext bits; member in union:long_double_u
[all...] |
| /external/chromium_org/third_party/icu/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/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/libogg/src/ |
| bitwise.c | 18 /* We're 'LSb' endian; if we write a word but read individual bits,
59 void oggpack_writetrunc(oggpack_buffer *b,long bits){
60 long bytes=bits>>3;
62 bits-=bytes*8;
64 b->endbit=bits;
66 *b->ptr&=mask[bits];
70 void oggpackB_writetrunc(oggpack_buffer *b,long bits){
71 long bytes=bits>>3;
73 bits-=bytes*8;
75 b->endbit=bits;
164 int bits=8-b->endbit; local
170 int bits=8-b->endbit; local
[all...] |
