HomeSort by relevance Sort by last modified time
    Searched refs:bits (Results 226 - 250 of 3823) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/gnu/
stubs.h 4 #include <bits/wordsize.h>
  /system/extras/perfprofd/quipper/kernel-headers/tools/perf/util/include/linux/
types.h 29 #define DECLARE_BITMAP(name,bits) unsigned long name[BITS_TO_LONGS(bits)]
  /system/extras/perfprofd/quipper/original-kernel-headers/tools/perf/util/include/linux/
types.h 14 #define DECLARE_BITMAP(name,bits) \
15 unsigned long name[BITS_TO_LONGS(bits)]
  /external/webrtc/src/common_audio/signal_processing/include/
spl_inl.h 82 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)) bits += 1
    [all...]
  /frameworks/minikin/include/minikin/
FontFamily.h 52 explicit FontLanguage(uint32_t bits) : mBits(bits) { }
54 uint32_t bits() const { return mBits; } function in class:android::FontLanguage
69 bits = (weight & kWeightMask) | (italic ? kItalicMask : 0);
72 bits = (weight & kWeightMask) | (italic ? kItalicMask : 0)
73 | (variant << kVariantShift) | (lang.bits() << kLangShift);
75 int getWeight() const { return bits & kWeightMask; }
76 bool getItalic() const { return (bits & kItalicMask) != 0; }
77 int getVariant() const { return (bits >> kVariantShift) & kVariantMask; }
78 FontLanguage getLanguage() const { return FontLanguage(bits >> kLangShift);
89 uint32_t bits; member in class:android::FontStyle
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/endo/
GLVTypeBParameters.java 11 protected final int bits; field in class:GLVTypeBParameters
14 BigInteger g2, int bits)
22 this.bits = bits;
57 return bits;
  /external/zopfli/src/zopfli/
tree.c 34 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] = code
    [all...]
  /external/compiler-rt/lib/sanitizer_common/scripts/
sancov.py 23 def CheckBits(bits):
24 if bits != 32 and bits != 64:
25 raise Exception("Wrong bitness: %d" % bits)
27 def TypeCodeForBits(bits):
28 CheckBits(bits)
29 return 'L' if bits == 64 else 'I'
35 def MagicForBits(bits):
36 CheckBits(bits)
38 return [kMagic64SecondHalf if bits == 64 else kMagic32SecondHalf, kMagicFirstHalf
    [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:__anon1129
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:__anon1130
103 _scan_nan(u.bits, 1, s);
104 u.bits[0] |= 0x7fc00000
    [all...]
  /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/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:__anon27859
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:__anon27860
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;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/i386-linux-gnu/bits/
time.h 27 # include <bits/types.h>
54 # include <bits/types.h>
86 # include <bits/timex.h>
96 # endif /* bits/time.h */
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/x86_64-linux-gnu/bits/
time.h 27 # include <bits/types.h>
54 # include <bits/types.h>
86 # include <bits/timex.h>
96 # endif /* bits/time.h */
  /system/bt/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...]

Completed in 2531 milliseconds

1 2 3 4 5 6 7 8 91011>>