Searched refs:bits (Results 926 - 950 of 1594) sorted by relevance

<<31323334353637383940>>

/external/libvpx/libvpx/vp8/common/ppc/
H A Dloopfilter_filters_altivec.asm32 ;# when we think of them as permutations of address bits: Concatenate a
34 ;# memory beginning at address zero. The low four bits 0...3 of the
36 ;# address bits select the register.
40 ;# still if the low-order bits of the register number correspond to
41 ;# conceptual address bits. We do this whenever reasonable.
44 ;# a 256-element block of memory. It takes 8 bits 0...7 to address this
47 ;# column, which is interchanged with the row addressed by bits 4..7.
83 ;# Except for bits s and d, the other relationships between register
84 ;# number (= high-order part of address) bits are at the disposal of
162 ;# We begin by reading the data 32 bits a
[all...]
/external/aac/libAACenc/src/
H A Ddyn_bits.cpp118 /* count bits using all possible tables */
258 /* Side-Info bits will be calculated in Stage 1! */
299 /* we can merge. update tables, side info bits will be updated outside of this loop */
307 /* add side info info bits */
388 /* count bits used by the noiseless coder */
432 /* count bits in this group */
463 compress output, calculate total huff and side bits
485 /* sum up side info bits (section data bits) */
497 description : count bits use
674 int i, bits=0; local
[all...]
/external/bluetooth/bluedroid/embdrv/sbc/decoder/include/
H A Doi_codec_sbc.h168 } bits; member in struct:__anon1108
423 @return the approximate bit rate in bits per second,
/external/chromium_org/gpu/command_buffer/client/
H A Dtransfer_buffer.cc9 #include "base/bits.h"
110 return (dimension == 0) ? 0 : 1 << base::bits::Log2Ceiling(dimension);
/external/chromium_org/net/spdy/
H A Dhpack_input_stream.cc39 if ((peeked >> (32 - prefix.bit_size)) == prefix.bits) {
139 // and the remaining unfilled bits of |out|.
143 // Shift byte remainder to most-signifcant bits of |new_bits|.
144 // This drops the leading |bit_offset| bits of the byte.
146 // Shift bits to the most-significant open bits of |out|.
/external/chromium_org/third_party/boringssl/src/include/openssl/
H A Dmodes.h87 * bits of the counter. This is useful when |ctr| can be an optimised
128 * CTR function that only handles the bottom 32 bits of the nonce, like
136 * CTR function that only handles the bottom 32 bits of the nonce, like
165 * 128 bits long, but the output will round up to the nearest 128 bit multiple,
172 * bits then only that many bytes will be written, but a multiple of 128 bits
210 void CRYPTO_cfb128_1_encrypt(const uint8_t *in, uint8_t *out, size_t bits,
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/
H A Dstun.h365 void SetValue(uint32 bits) { bits_ = bits; } argument
388 void SetValue(uint64 bits) { bits_ = bits; } argument
/external/chromium_org/third_party/libjpeg_turbo/
H A Djdhuff.c187 i = (int) htbl->bits[l];
208 * it must still fit in si bits, since no code is allowed to be all ones.
220 if (htbl->bits[l]) {
225 p += htbl->bits[l];
246 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
306 /* Attempt to load at least MIN_GET_BITS bits into get_buffer. */
307 /* (It is assumed that no request will be for more than that many bits.) */
355 /* See if we need to insert some fake zero bits. */
367 * data segment. There should be enough bits in the buffer register
380 /* Fill the buffer with zero bits */
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
H A Dr300_fragprog_emit.c65 static unsigned int get_msbs_alu(unsigned int bits) argument
67 return (bits >> 6) & 0x7;
71 * @param lsbs The number of least significant bits
73 static unsigned int get_msbs_tex(unsigned int bits, unsigned int lsbs) argument
75 return (bits >> lsbs) & 0x15;
/external/chromium_org/third_party/mesa/src/src/gallium/include/pipe/
H A Dp_video_state.h163 } bits; member in union:pipe_mpeg12_macroblock::__anon14143
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dmatrix.h45 static INLINE VGint float_to_int_floor(VGuint bits) argument
47 int sign = (bits >> 31) ? -1 : 1;
48 int exp = ((bits >> 23) & 255) - 127;
49 int mant = bits & 0x007fffff;
/external/chromium_org/third_party/opus/src/celt/
H A Dfixed_debug.h47 /** 16x32 multiplication, followed by a 16-bit shift right. Results fits in 32 bits */
52 #define QCONST16(x,bits) ((opus_val16)(.5+(x)*(((opus_val32)1)<<(bits))))
53 #define QCONST32(x,bits) ((opus_val32)(.5+(x)*(((opus_val32)1)<<(bits))))
383 /* result fits in 16 bits */
/external/chromium_org/third_party/tlslite/tlslite/utils/
H A Drsakey.py37 """Return the length of this key in bits.
211 def generate(bits):
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/
H A Dstrict.asm0 bits 32
88 bits 64 label
1 bits 32 label
/external/chromium_org/v8/src/compiler/
H A Dmachine-type.h8 #include "src/base/bits.h"
78 CHECK(base::bits::IsPowerOfTwo32(result));
/external/chromium_org/v8/test/webkit/fast/js/kde/
H A Dmd5-1.js348 var bits = new array(8);
353        bits[i] = and(shr(count[0],(i * 8)), 0xff);
357        bits[i+4]=and(shr(count[1],(i * 8)), 0xff);
368        update(bits[i]);
/external/clang/test/Sema/
H A Dcast.c3 typedef struct { unsigned long bits[(((1) + (64) - 1) / (64))]; } cpumask_t; member in struct:__anon19078
/external/flac/libFLAC/ia32/
H A Dnasm.h31 bits 32
/external/guava/guava/src/com/google/common/hash/
H A DMurmur3_128HashFunction.java38 @Override public int bits() { method in class:Murmur3_128HashFunction
/external/iproute2/doc/
H A Dapi-ip6-flowlabels.tex22 Every IPv6 packet carries 28 bits of flow information. RFC2460 splits
23 these bits to two fields: 8 bits of traffic class (or DS field, if you
24 prefer this term) and 20 bits of flow label. Currently there exist
34 \item To allow user to set traffic class bits.
36 \item To allow user to read traffic class bits of received packets.
40 using traffic class bits.
53 so that any subset of 20 bits can be used as hash key.
/external/iproute2/include/
H A Dutils.h107 extern int inet_addr_match(const inet_prefix *a, const inet_prefix *b, int bits);
/external/iproute2/ip/
H A Dxfrm.h119 int xfrm_addr_match(xfrm_address_t *x1, xfrm_address_t *x2, int bits);
/external/jpeg/
H A Djdhuff.c185 i = (int) htbl->bits[l];
206 * it must still fit in si bits, since no code is allowed to be all ones.
218 if (htbl->bits[l]) {
223 p += htbl->bits[l];
242 for (i = 1; i <= (int) htbl->bits[l]; i++, p++) {
303 /* Attempt to load at least MIN_GET_BITS bits into get_buffer. */
304 /* (It is assumed that no request will be for more than that many bits.) */
352 /* See if we need to insert some fake zero bits. */
364 * data segment. There should be enough bits in the buffer register
377 /* Fill the buffer with zero bits */
[all...]
/external/kernel-headers/original/uapi/linux/
H A Dtelephony.h204 * frame type is encoded in the least significant two bits of the first
207 * bits 1-0 Frame Type Data Rate Significant Words
211 * 11 3 Repeat last CNG 2 bits
229 * and f3 bits indicate that the filter has been triggered by detecting the
232 * The remaining bits should be set to zero. They will become defined over time
256 struct phone_except bits; member in union:telephony_exception
/external/libopus/celt/
H A Dfixed_debug.h47 /** 16x32 multiplication, followed by a 16-bit shift right. Results fits in 32 bits */
52 #define QCONST16(x,bits) ((opus_val16)(.5+(x)*(((opus_val32)1)<<(bits))))
53 #define QCONST32(x,bits) ((opus_val32)(.5+(x)*(((opus_val32)1)<<(bits))))
383 /* result fits in 16 bits */

Completed in 763 milliseconds

<<31323334353637383940>>