HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 1 - 25 of 417) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/webrtc/src/common_audio/signal_processing_library/main/source/
get_size_in_bits.c 25 int bits = 0; local
27 // Fast binary search to find the number of bits used
29 bits = 16;
30 if ((0x0000FF00 & (value >> bits)))
31 bits += 8;
32 if ((0x000000F0 & (value >> bits)))
33 bits += 4;
34 if ((0x0000000C & (value >> bits)))
35 bits += 2;
36 if ((0x00000002 & (value >> bits)))
    [all...]
  /external/chromium/base/
bits_unittest.cc 7 #include "base/bits.h"
11 namespace bits { namespace in namespace:base
47 } // namespace bits
bits.h 15 namespace bits { namespace in namespace:base
45 } // namespace bits
  /external/dropbear/libtommath/
bn_mp_montgomery_calc_normalization.c 26 int x, bits, res; local
28 /* how many bits of last digit does b use */
29 bits = mp_count_bits (b) % DIGIT_BIT;
32 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
37 bits = 1;
42 for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
  /external/webkit/Source/JavaScriptCore/wtf/
RandomNumber.cpp 57 uint32_t bits = cryptographicallyRandomNumber(); local
58 return static_cast<double>(bits) / (static_cast<double>(std::numeric_limits<uint32_t>::max()) + 1.0);
75 uint32_t bits;
82 ISOURCE_Read(randomSource.get(), reinterpret_cast<char*>(&bits), 4);
84 return static_cast<double>(bits) / (static_cast<double>(std::numeric_limits<uint32_t>::max()) + 1.0);
88 // rand only provides 31 bits, and the low order bits of that aren't very random
89 // so we take the high 26 bits of part 1, and the high 27 bits of part2.
90 part1 >>= 5; // drop the low 5 bits
    [all...]
  /frameworks/base/media/libstagefright/codecs/aacdec/
sbr_decode_huff_cw.cpp 41 Reads bits from the bitstream until a valid codeword is found.
137 Int32 bits; local
142 bits = buf_get_1bit(hBitBuf);
143 index = h[index][bits];
sbr_get_cpe.cpp 145 Int32 bits; local
148 /* reserved bits */
149 bits = buf_getbits(hBitBuf, SI_SBR_RESERVED_PRESENT);
151 if (bits)
158 bits = buf_getbits(hBitBuf, SI_SBR_COUPLING_BITS);
160 if (bits)
sbr_get_sce.cpp 148 Int32 bits; local
151 /* reserved bits */
152 bits = buf_getbits(hBitBuf, SI_SBR_RESERVED_PRESENT);
154 if (bits)
huffcb.cpp 46 (2) put BITS *pInputStream as second parameter
55 when the number of bits read is 9 or less and get1bits
74 Int sectbits = array that defines the number of bits
84 BITS *pInputStream = pointer to input stream
95 Int bits = number of bits needed for expressing section length
285 BITS *pInputStream,
298 Int bits; /* # of bits used to express esc_val */ local
308 bits = sectbits[0]; /* 3 for SHORT_WIN, 5 for LONG_WIN *
    [all...]
  /external/llvm/lib/Support/
Disassembler.cpp 49 unsigned bits; local
51 bits = 32;
53 bits = 64;
60 ud_set_mode(&ud_obj, bits);
65 << std::setw(bits/4);
  /external/wpa_supplicant_8/src/crypto/
md5_i.h 20 u32 bits[2]; member in struct:MD5Context
  /frameworks/base/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);
  /external/qemu/distrib/sdl-1.2.12/src/video/qtopia/
SDL_sysmouse.cc 32 char *bits; member in struct:WMcursor
38 dummy.bits = 0;
  /external/webkit/Source/WebKit2/WebProcess/WebPage/win/
ChunkedUpdateDrawingAreaWin.cpp 42 void* bits; local
44 OwnPtr<HBITMAP> hbmp(::CreateDIBSection(0, &bmp, DIB_RGB_COLORS, &bits, updateChunk->memory(), 0));
  /bionic/libm/src/
s_nan.c 63 * the same as gcc's __builtin_nan(), namely, discard the high order bits.
75 int bitpos; /* index into words (in bits) */
87 /* Scan backwards, filling in the bits in words[] as we go. */
104 uint32_t bits[2]; member in union:__anon629
107 _scan_nan(u.bits, 2, s);
109 u.bits[1] |= 0x7ff80000;
111 u.bits[0] |= 0x7ff80000;
121 uint32_t bits[1]; member in union:__anon630
124 _scan_nan(u.bits, 1, s);
125 u.bits[0] |= 0x7fc00000
    [all...]
  /external/chromium/third_party/libjingle/source/talk/base/
md5.h 32 uint32 bits[2]; member in struct:MD5Context
  /external/openssl/crypto/bn/
bn_mpi.c 65 int bits; local
70 bits=BN_num_bits(a);
71 num=(bits+7)/8;
72 if (bits > 0)
74 ext=((bits & 0x07) == 0);
  /external/qemu/distrib/zlib-1.2.3/
inftrees.h 14 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; /* bits in this part of the code * member in struct:__anon9856
    [all...]
  /external/webkit/Tools/DumpRenderTree/win/
PixelDumpSupportWin.cpp 61 void* bits = 0; local
62 HBITMAP bitmap = CreateDIBSection(0, &bmp, DIB_RGB_COLORS, &bits, 0, 0);
  /bionic/libm/alpha/
_fpmath.h 36 } bits; member in union:IEEEl2bits
47 (a)[0] = (uint32_t)(u).bits.manl; \
48 (a)[1] = (uint32_t)(u).bits.manh; \
  /bionic/libm/amd64/
_fpmath.h 38 } bits; member in union:IEEEl2bits
42 #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT)
48 (a)[0] = (uint32_t)(u).bits.manl; \
49 (a)[1] = (uint32_t)(u).bits.manh; \
  /bionic/libm/arm/
_fpmath.h 43 } bits; member in union:IEEEl2bits
53 (a)[0] = (uint32_t)(u).bits.manl; \
54 (a)[1] = (uint32_t)(u).bits.manh; \
  /bionic/libm/i386/
_fpmath.h 37 } bits; member in union:IEEEl2bits
41 #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT)
47 (a)[0] = (uint32_t)(u).bits.manl; \
48 (a)[1] = (uint32_t)(u).bits.manh; \
  /bionic/libm/ia64/
_fpmath.h 48 } bits; member in union:IEEEl2bits
53 #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT)
62 #define mask_nbit_l(u) ((u).bits.manh &= ~LDBL_NBIT)
69 (a)[0] = (uint32_t)(u).bits.manl; \
70 (a)[1] = (uint32_t)(u).bits.manh; \
  /bionic/libm/powerpc/
_fpmath.h 36 } bits; member in union:IEEEl2bits
47 (a)[0] = (uint32_t)(u).bits.manl; \
48 (a)[1] = (uint32_t)(u).bits.manh; \

Completed in 276 milliseconds

1 2 3 4 5 6 7 8 91011>>