Searched defs:bits (Results 276 - 300 of 403) sorted by relevance

<<11121314151617

/external/tremolo/Tremolo/
H A Dvorbisfile.c879 ogg_int64_t bits=0; local
882 bits+=(vf->offsets[i+1]-vf->dataoffsets[i])*8;
883 /* This once read: return(rint(bits/ov_time_total(vf,-1)));
887 return (long)(bits*1000/ov_time_total(vf,-1));
/external/v8/src/
H A Dutils.h59 int bits = 0; local
64 bits += 16;
68 bits += 8;
72 bits += 4;
77 case 8: bits++; // Fall through.
78 case 4: bits++; // Fall through.
79 case 2: bits++; // Fall through.
82 ASSERT_EQ(1 << bits, original_x);
83 return bits;
221 // A uint32_t mask of bit field. To use all bits o
[all...]
/external/webkit/Source/ThirdParty/ANGLE/src/libGLESv2/
H A Dutilities.cpp162 int AllocateFirstFreeBits(unsigned int *bits, unsigned int allocationSize, unsigned int bitsSize) argument
170 if ((*bits & mask) == 0)
172 *bits |= mask;
/external/webkit/Source/WebCore/plugins/android/
H A DPluginViewAndroid.cpp556 uint32_t* bits = reinterpret_cast<uint32_t*>(value); local
557 *bits = kBitmap_ANPDrawingModel & kSurface_ANPDrawingModel;
/external/webkit/Source/WebCore/plugins/win/
H A DPluginViewWin.cpp1034 void* bits; local
1036 OwnPtr<HBITMAP> hbmp(CreateDIBSection(0, &bmp, DIB_RGB_COLORS, &bits, 0, 0));
/external/webp/src/dec/
H A Dvp8.c106 const uint32_t bits = data[0] | (data[1] << 8) | (data[2] << 16); local
107 const int key_frame = !(bits & 1);
115 if (((bits >> 1) & 7) > 3) {
118 if (!((bits >> 4) & 1)) {
121 if (((bits >> 5)) >= chunk_size) { // partition_length
308 const uint32_t bits = buf[0] | (buf[1] << 8) | (buf[2] << 16); local
310 frm_hdr->key_frame_ = !(bits & 1);
311 frm_hdr->profile_ = (bits >> 1) & 7;
312 frm_hdr->show_ = (bits >> 4) & 1;
313 frm_hdr->partition_length_ = (bits >>
[all...]
/external/wpa_supplicant_6/wpa_supplicant/src/crypto/
H A Dcrypto_internal.c45 u32 bits[2]; member in struct:MD5Context
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dhostapd.c420 unsigned int i = iface->conf->num_bss, bits = 0, j; local
428 /* Determine the bits necessary to cover the number of BSSIDs. */
430 bits++;
432 /* Determine the bits necessary to any configured BSSIDs,
463 if (bits < j)
464 bits = j;
466 if (bits > 40) {
467 wpa_printf(MSG_ERROR, "Too many bits in the BSSID mask (%u)",
468 bits);
473 j = bits /
[all...]
/external/wpa_supplicant_8/src/ap/
H A Dhostapd.c420 unsigned int i = iface->conf->num_bss, bits = 0, j; local
428 /* Determine the bits necessary to cover the number of BSSIDs. */
430 bits++;
432 /* Determine the bits necessary to any configured BSSIDs,
463 if (bits < j)
464 bits = j;
466 if (bits > 40) {
467 wpa_printf(MSG_ERROR, "Too many bits in the BSSID mask (%u)",
468 bits);
473 j = bits /
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dhostapd.c420 unsigned int i = iface->conf->num_bss, bits = 0, j; local
428 /* Determine the bits necessary to cover the number of BSSIDs. */
430 bits++;
432 /* Determine the bits necessary to any configured BSSIDs,
463 if (bits < j)
464 bits = j;
466 if (bits > 40) {
467 wpa_printf(MSG_ERROR, "Too many bits in the BSSID mask (%u)",
468 bits);
473 j = bits /
[all...]
/external/zlib/src/
H A Dtrees.c48 /* Bit length codes must not exceed MAX_BL_BITS bits */
54 /* repeat previous bit length 3-6 times (2 bits of repeat count) */
57 /* repeat a zero length 3-10 times (3 bits of repeat count) */
60 /* repeat a zero length 11-138 times (7 bits of repeat count) */
62 local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
65 local const int extra_dbits[D_CODES] /* extra bits for each distance code */
68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
95 * 5 bits.)
100 * 3 .. 258, the last 256 values correspond to the top 8 bits of
119 const intf *extra_bits; /* extra bits fo
239 int bits; /* bit counter */ local
500 int bits; /* bit length */ local
582 int bits; /* bit index */ local
[all...]
/external/aac/libMpegTPDec/src/
H A Dtpdec_lib.cpp321 needs a number 2^x. So we assume the maximum of 48 channels with 6144 bits per channel
376 * \param bitsAvail the amount of available bits at the end of the first frame to be decoded.
460 /* For ELD and other payloads there is an unknown amount of padding, so ignore unread bits, but
461 throw an error only if too many bits where read. */
480 /* How many bits to advance for synchronization search. */
501 INT syncLength; /* Length of sync word in bits */
538 INT checkLengthBits; /* Helper to check remaining bits and buffer boundaries */
610 /* Reset CRC because the next bits are the beginning of a raw_data_block() */
700 int bits; local
706 bits
1001 INT bits; local
[all...]
/external/chromium/testing/gtest/include/gtest/internal/
H A Dgtest-internal.h300 // For float, there are 8 exponent bits and 23 fraction bits.
302 // For double, there are 11 exponent bits and 52 fraction bits.
319 // # of bits in a number.
322 // # of fraction bits in a number.
326 // # of exponent bits in a number.
332 // The mask for the fraction bits.
336 // The mask for the exponent bits.
347 // bits
366 ReinterpretBits(const Bits bits) argument
380 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint
[all...]
/external/clang/test/SemaCXX/
H A Doverload-call.cpp124 void test_bitfield(Bits bits, int x) { argument
125 int* ip = bitfields(bits.int_bitfield, 0);
126 float* fp = bitfields(bits.uint_bitfield, 0u);
/external/gtest/include/gtest/internal/
H A Dgtest-internal.h306 // For float, there are 8 exponent bits and 23 fraction bits.
308 // For double, there are 11 exponent bits and 52 fraction bits.
325 // # of bits in a number.
328 // # of fraction bits in a number.
332 // # of exponent bits in a number.
338 // The mask for the fraction bits.
342 // The mask for the exponent bits.
353 // bits
372 ReinterpretBits(const Bits bits) argument
386 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint
[all...]
/external/iproute2/ip/
H A Dipxfrm.c71 int xfrm_addr_match(xfrm_address_t *x1, xfrm_address_t *x2, int bits) argument
75 int words = bits >> 0x05;
77 bits &= 0x1f;
83 if (bits) {
90 mask = htonl((0xffffffff) << (0x20 - bits));
538 fprintf(fp, " (%d bits)", algo->alg_key_len);
/external/jpeg/
H A Djdmarker.c423 UINT8 bits[17]; local
437 bits[0] = 0;
440 INPUT_BYTE(cinfo, bits[i], return FALSE);
441 count += bits[i];
447 bits[1], bits[2], bits[3], bits[4],
448 bits[5], bits[
[all...]
/external/kernel-headers/original/linux/
H A Dtelephony.h208 * frame type is encoded in the least significant two bits of the first
211 * bits 1-0 Frame Type Data Rate Significant Words
215 * 11 3 Repeat last CNG 2 bits
233 * and f3 bits indicate that the filter has been triggered by detecting the
236 * The remaining bits should be set to zero. They will become defined over time
260 struct phone_except bits; member in union:telephony_exception
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h155 CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits, argument
157 Mask(mask), BB(bb), Bits(bits), ExtraWeight(Weight) { }
/external/llvm/lib/Target/CellSPU/
H A DSPUISelDAGToDAG.cpp747 // Take advantage of the fact that the upper 32 bits are in the
925 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
934 if (bits > 0) {
938 CurDAG->getTargetConstant(bits, ShiftAmtVT));
984 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
993 if (bits > 0) {
997 CurDAG->getTargetConstant(bits, ShiftAmtVT));
1074 unsigned bits = unsigned(CN->getZExtValue()) & 7; local
1084 if (bits > 0) {
1085 bits
[all...]
/external/llvm/utils/TableGen/
H A DFixedLenDecoderEmitter.cpp144 static bit_value_t bitFromBits(const BitsInit &bits, unsigned index) { argument
145 if (BitInit *bit = dynamic_cast<BitInit*>(bits.getBit(index)))
152 static void dumpBits(raw_ostream &o, const BitsInit &bits) { argument
153 for (unsigned index = bits.getNumBits(); index > 0; --index) {
154 switch (bitFromBits(bits, index - 1)) {
171 BitsInit *bits = def.getValueAsBitsInit(str); local
172 return *bits;
189 /// words, what other remaining bits to look at. The FilterChooser eventually
224 unsigned NumBits; // number of bits to filter
225 bool Mixed; // a mixed region contains both set and unset bits
[all...]
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-internal.h325 // For float, there are 8 exponent bits and 23 fraction bits.
327 // For double, there are 11 exponent bits and 52 fraction bits.
344 // # of bits in a number.
347 // # of fraction bits in a number.
351 // # of exponent bits in a number.
357 // The mask for the fraction bits.
361 // The mask for the exponent bits.
372 // bits
391 ReinterpretBits(const Bits bits) argument
405 const Bits &bits() const { return u_.bits_; } function in class:testing::internal::FloatingPoint
[all...]
/external/openssh/
H A Dssh-agent.c362 u_int blen, bits; local
370 bits = buffer_get_int(&e->request);
374 if (bits != key_size(key))
376 key_size(key), bits);
/external/openssl/crypto/engine/
H A Deng_cryptodev.c929 ssize_t bytes, bits; local
935 bits = BN_num_bits(a);
936 bytes = (bits + 7) / 8;
944 crp->crp_nbits = bits;
/external/qemu/distrib/jpeg-6b/
H A Djdmarker.c423 UINT8 bits[17]; local
437 bits[0] = 0;
440 INPUT_BYTE(cinfo, bits[i], return FALSE);
441 count += bits[i];
447 bits[1], bits[2], bits[3], bits[4],
448 bits[5], bits[
[all...]

Completed in 566 milliseconds

<<11121314151617