Searched refs:bits (Results 726 - 750 of 1594) sorted by relevance

<<21222324252627282930>>

/external/chromium_org/v8/src/
H A Dallocation.cc8 #include "src/base/bits.h"
88 DCHECK(base::bits::IsPowerOfTwo32(alignment));
/external/deqp/framework/common/
H A DtcuTexVerifierUtil.hpp97 void getPossibleCubeFaces (const Vec3& coord, const IVec3& bits, CubeFace* faces, int& numFaces);
/external/dexmaker/src/dx/java/com/android/dx/util/
H A DListIntSet.java90 for (int i = 0; i >= 0; i = Bits.findFirst(o.bits, i + 1)) {
/external/guava/guava/src/com/google/common/math/
H A DBigIntegerMath.java109 * The maximum number of bits in a square root for which we'll precompute an explicit half power
305 int bits = LongMath.log2(startingNumber, FLOOR) + 1;
307 int nextPowerOfTwo = 1 << (bits - 1);
314 bits++;
321 int normalizedBits = bits - tz;
/external/libvorbis/vq/
H A Dmetrics.c32 total bits
34 (average bits per sample)*/
49 float bits=0.f; variable
135 fprintf(stderr,"\ttotal bits required to code: %ld\n",(long)bits);
136 fprintf(stderr,"\taverage bits per sample: %g\n\n",bits/count);
242 bits+=vorbis_book_codelen(b,entry);
/external/libvpx/libvpx/vp8/encoder/
H A Dboolhuff.h46 extern void vp8_encode_value(BOOL_CODER *br, int data, int bits);
/external/llvm/test/MC/AsmParser/
H A Ddirective_fill.s59 # CHECK-WARNINGS: '.fill' directive pattern has been truncated to 32-bits
/external/llvm/test/MC/Mips/
H A Dhilo-addressing.s11 # Check that 1 is added to the high 16 bits if bit 15 of the low part is 1.
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.cpp278 data[(size + 31) / 32 - 1] = 0; // clear unused bits (e.g. for popCount)
376 uint32_t bits = data[i]; local
377 while (bits) {
378 int pos = ffs(bits) - 1;
379 bits &= ~(1 << pos);
/external/mesa3d/src/gallium/drivers/softpipe/
H A Dsp_tex_sample.h81 } bits; member in union:sp_sampler_key
/external/pixman/pixman/
H A Dpixman-arm-simd.c84 uint32_t * bits,
102 (uint8_t *)(((char *) bits) + y * byte_stride + x),
110 (uint16_t *)(((char *) bits) + y * byte_stride + x * 2),
118 (uint32_t *)(((char *) bits) + y * byte_stride + x * 4),
83 arm_simd_fill(pixman_implementation_t *imp, uint32_t * bits, int stride, int bpp, int x, int y, int width, int height, uint32_t _xor) argument
/external/regex-re2/re2/
H A Dprog.cc317 uint32 bits = 0; local
320 bits = v.Word(i >> 5);
322 n += bits & 1;
323 bits >>= 1;
/external/srec/srec/cfront/
H A Dhimul32.h27 // DESCRIPTION: A multiplier returns most-significant 32 bits of the 64-bit
51 mulhw r3, factor1, factor2 # place the high order 32 bits of the product in the return register r3
57 himul32 returns the most-significant 32 bits of the 64-bit
69 the most-significant 32 bits of the multiplication results
83 // EAX, then IMUL, then take the high 32 bits (in EDX) and move them
/external/webp/src/utils/
H A Dbit_writer.h30 int run_; // number of outstanding bits
31 int nb_bits_; // number of pending bits
55 // return approximate write position (in bits)
84 int used_; // number of bits used in accumulator
89 // After all bits are written (VP8LBitWriterFinish()), the caller must observe
92 // writing of bits.
107 // This function writes bits into bytes in increasing addresses (little endian),
109 // This function can write up to 32 bits in one go, but VP8LBitReader can only
110 // read 24 bits max (VP8L_MAX_NUM_BIT_READ).
112 void VP8LWriteBits(VP8LBitWriter* const bw, int n_bits, uint32_t bits);
[all...]
/external/chromium_org/chrome/browser/ui/views/panels/
H A Dtaskbar_window_thumbnailer_win.cc25 void* bits; local
29 &bits,
34 bitmap.copyPixelsTo(bits, width * height * 4, width * 4);
/external/chromium_org/third_party/angle/src/common/
H A Dutilities.cpp319 int AllocateFirstFreeBits(unsigned int *bits, unsigned int allocationSize, unsigned int bitsSize) argument
327 if ((*bits & mask) == 0)
329 *bits |= mask;
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ppc/
H A Dfdct_altivec.asm115 vspltisw v7, 14 ;# == 14, fits in 5 signed bits
126 vspltisw v7, -16 ;# == 16 == -16, only low 5 bits matter
144 vspltisw v7, 14 ;# == 14, fits in 5 signed bits
155 vspltisw v7, -16 ;# == 16 == -16, only low 5 bits matter
167 vspltisw v7, 14 ;# == 14, fits in 5 signed bits
177 vspltisw v7, -16 ;# == 16 == -16, only low 5 bits matter
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/i915/
H A Di915_debug.c285 unsigned bits = (ptr[0] >> 4) & 0xff; local
288 PRINTF(stream, "%s (%d dwords, flags: %x):\n", name, len, bits);
291 if (bits & (1<<0)) {
297 if (bits & (1<<1)) {
304 if (bits & (1<<2)) {
314 if (bits & (1<<3)) {
318 if (bits & (1<<4)) {
340 if (bits & (1<<5)) {
358 if (bits & (1<<6)) {
392 unsigned bits local
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/
H A Di915_debug.c209 GLuint bits = (ptr[0] >> 4) & 0xff; local
212 printf("%s (%d dwords, flags: %x):\n", name, len, bits);
215 if (bits & (1<<0)) {
221 if (bits & (1<<1)) {
228 if (bits & (1<<2)) {
238 if (bits & (1<<3)) {
242 if (bits & (1<<4)) {
264 if (bits & (1<<5)) {
282 if (bits & (1<<6)) {
315 GLuint bits local
[all...]
/external/chromium_org/third_party/speex/libspeex/
H A Dltp.c248 /* Normalize to 180 so we can square it and it still fits in 16 bits */
359 SpeexBits *bits,
541 SpeexBits *bits,
581 speex_bits_pack(bits, 0, params->pitch_bits);
582 speex_bits_pack(bits, 0, params->gain_bits);
622 bits, stack, exc2, r, new_target, &cdbk_index, plc_tuning, *cumul_gain, scaledown);
633 speex_bits_pack(bits, best_pitch-start, params->pitch_bits);
634 speex_bits_pack(bits, best_gain_index, params->gain_bits);
665 SpeexBits *bits,
685 pitch = speex_bits_unpack_unsigned(bits, param
348 pitch_gain_search_3tap( const spx_word16_t target[], const spx_coef_t ak[], const spx_coef_t awk1[], const spx_coef_t awk2[], spx_sig_t exc[], const signed char *gain_cdbk, int gain_cdbk_size, int pitch, int p, int nsf, SpeexBits *bits, char *stack, const spx_word16_t *exc2, const spx_word16_t *r, spx_word16_t *new_target, int *cdbk_index, int plc_tuning, spx_word32_t cumul_gain, int scaledown ) argument
528 pitch_search_3tap( spx_word16_t target[], spx_word16_t *sw, spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], spx_sig_t exc[], const void *par, int start, int end, spx_word16_t pitch_coef, int p, int nsf, SpeexBits *bits, char *stack, spx_word16_t *exc2, spx_word16_t *r, int complexity, int cdbk_offset, int plc_tuning, spx_word32_t *cumul_gain ) argument
655 pitch_unquant_3tap( spx_word16_t exc[], spx_word32_t exc_out[], int start, int end, spx_word16_t pitch_coef, const void *par, int nsf, int *pitch_val, spx_word16_t *gain_val, SpeexBits *bits, char *stack, int count_lost, int subframe_offset, spx_word16_t last_pitch_gain, int cdbk_offset ) argument
755 forced_pitch_quant( spx_word16_t target[], spx_word16_t *sw, spx_coef_t ak[], spx_coef_t awk1[], spx_coef_t awk2[], spx_sig_t exc[], const void *par, int start, int end, spx_word16_t pitch_coef, int p, int nsf, SpeexBits *bits, char *stack, spx_word16_t *exc2, spx_word16_t *r, int complexity, int cdbk_offset, int plc_tuning, spx_word32_t *cumul_gain ) argument
805 forced_pitch_unquant( spx_word16_t exc[], spx_word32_t exc_out[], int start, int end, spx_word16_t pitch_coef, const void *par, int nsf, int *pitch_val, spx_word16_t *gain_val, SpeexBits *bits, char *stack, int count_lost, int subframe_offset, spx_word16_t last_pitch_gain, int cdbk_offset ) argument
[all...]
/external/chromium_org/third_party/tlslite/tlslite/utils/
H A Dpython_rsakey.py70 def generate(bits):
72 p = getRandomPrime(bits//2, False)
73 q = getRandomPrime(bits//2, False)
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/
H A Dx86arch.h117 /* 0-15 (low 4 bits) used for register number, stored in same data area.
136 /* Low 8 bits are used for the prefix value, stored in same data area. */
167 /* Sets REX (4th bit) and 3 LS bits from register size/number. Returns 1 if
173 uintptr_t reg, unsigned int bits,
183 /* How the spare (register) bits in Mod/RM are handled:
184 * Even if valid_modrm=0, the spare bits are still valid (don't overwrite!)
202 unsigned char *rex, unsigned int bits);
258 /* Override any attempt at address-size override to 16 bits, and never
300 (x86_effaddr *x86_ea, unsigned char *addrsize, unsigned int bits,
/external/elfutils/0.153/libdwfl/
H A Dlibdwfl.h236 /* Report the known build ID bits associated with a module.
238 bits are found within the module. This can be called at any
243 const unsigned char *bits, size_t len,
247 /* Extract the build ID bits associated with a module.
250 at which the ID bits are found within the module, or 0 if unknown.
253 and its build ID bits were not reported. To ensure the ID is always
256 const unsigned char **bits, GElf_Addr *vaddr)
293 bits passed to dwfl_module_report_build_id, if any. */
300 to use the build ID bits from the main file when present. */
563 int bits, in
[all...]
/external/elfutils/elfutils/
H A Dlibdwfl.h236 /* Report the known build ID bits associated with a module.
238 bits are found within the module. This can be called at any
243 const unsigned char *bits, size_t len,
247 /* Extract the build ID bits associated with a module.
250 at which the ID bits are found within the module, or 0 if unknown.
253 and its build ID bits were not reported. To ensure the ID is always
256 const unsigned char **bits, GElf_Addr *vaddr)
293 bits passed to dwfl_module_report_build_id, if any. */
300 to use the build ID bits from the main file when present. */
563 int bits, in
[all...]
/external/freetype/src/gzip/
H A Dinfcodes.c14 #define bits word.what.Bits macro
40 uInt need; /* bits needed */
44 uInt get; /* bits to get for extra */
50 Byte lbits; /* ltree bits decoded per branch */
51 Byte dbits; /* dtree bits decoder per branch */
87 uInt e; /* extra bits or operation */
89 uInt k; /* bits in bit buffer */
124 DUMPBITS(t->bits)
171 DUMPBITS(t->bits)

Completed in 842 milliseconds

<<21222324252627282930>>