HomeSort by relevance Sort by last modified time
    Searched defs:bits (Results 276 - 300 of 1014) sorted by null

<<11121314151617181920>>

  /external/zlib/src/
inffast.c 46 state->bits < 8
56 - The maximum input bits used by a length/distance pair is 15 bits for the
57 length code, 5 bits for the length extra, 15 bits for the distance code,
58 and 13 bits for the distance extra. This totals 48 bits, or six bytes.
85 unsigned bits; /* local strm->bits */ local
91 unsigned op; /* code bits, operation, extra bits, or *
    [all...]
  /libcore/luni/src/main/java/java/util/
Random.java 87 * the number of bits specified by the argument {@code bits} as
96 protected synchronized int next(int bits) {
98 return (int) (seed >>> (48 - bits));
187 int bits, val; local
189 bits = next(31);
190 val = bits % n;
191 } while (bits - val + (n - 1) < 0);
  /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_persist/src/
SyncML_DM_WBXMLWriter.cc 95 UINT8 result, bits; local
98 bits = (len >> shift) & 0x7F;
99 if ((bits!=0) ||(continuation != 0)) {
100 result = 0x80 | bits;
105 if (bits != 0)
  /system/core/libpixelflinger/codeflinger/
load_store.cpp 33 const int bits = addr.size; local
35 switch (bits) {
41 // 24 bits formats are a little special and used only for RGB
70 const int bits = addr.size; local
72 switch (bits) {
78 // 24 bits formats are a little special and used only for RGB
109 void GGLAssembler::extract(integer_t& d, int s, int h, int l, int bits)
122 if ((h == bits) && !l && (s != d.reg)) {
124 } else if ((h == bits) && l) {
134 if (h != bits) {
    [all...]
  /cts/tools/dex-tools/src/dex/reader/
DexBuffer.java 146 int bits = readInt(nBytes); local
148 bits <<= bytesToMove;
149 return Float.intBitsToFloat(bits);
173 long bits = readLong(nBytes); local
175 bits <<= bytesToMove;
176 return Double.longBitsToDouble(bits);
  /dalvik/dexgen/src/com/android/dexgen/util/
BitIntSet.java 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
    [all...]
  /dalvik/dx/src/com/android/dx/util/
BitIntSet.java 27 int[] bits; field in class:BitIntSet
35 bits = Bits.makeBitSet(max);
41 Bits.set(bits, value, true);
50 if (value >= Bits.getMax(bits)) {
51 int[] newBits = Bits.makeBitSet(
52 Math.max(value + 1, 2 * Bits.getMax(bits)));
    [all...]
  /external/bluetooth/bluedroid/bta/av/
bta_av_sbc.c 41 UINT16 bits; /* number of bits per pcm sample */ member in struct:__anon5085
58 ** bits: number of bits per pcm sample
64 void bta_av_sbc_init_up_sample (UINT32 src_sps, UINT32 dst_sps, UINT16 bits, UINT16 n_channels)
69 bta_av_sbc_ups_cb.bits = bits;
75 if(bits == 8)
89 if(bits == 8)
149 ** Function bta_av_sbc_up_sample_16s (16bits-stereo
    [all...]
  /external/bluetooth/bluedroid/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...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/
DERBitString.java 21 * return the correct number of pad bits for a bit string defined in
58 int bits = 1; local
62 bits++;
65 return 8 - bits;
145 * @param padBits the number of extra bits at the end of the string.
  /external/chromium_org/base/
md5.cc 32 uint32 bits[2]; member in struct:__anon6919::Context
162 ctx->bits[0] = 0;
163 ctx->bits[1] = 0;
179 t = ctx->bits[0];
180 if ((ctx->bits[0] = t + ((uint32)len << 3)) < t)
181 ctx->bits[1]++; /* Carry from low to high */
182 ctx->bits[1] += static_cast<uint32>(len >> 29);
220 * 1 0* (64-bit count of bits processed, MSB-first)
228 count = (ctx->bits[0] >> 3) & 0x3F;
253 /* Append length in bits and transform *
    [all...]
  /external/chromium_org/chrome/browser/ui/views/panels/
taskbar_window_thumbnailer_win.cc 25 void* bits; local
29 &bits,
34 bitmap.copyPixelsTo(bits, width * height * 4, width * 4);
  /external/chromium_org/net/spdy/
hpack_huffman_table.cc 21 // How many bits to index in the root decode table.
23 // Maximum number of bits to index in successive decode tables.
91 // At least one code (such as an EOS symbol) must be 8 bits or longer.
128 // Mask and shift the portion of the code being indexed into low bits.
225 // Load, and shift code to low bits.
274 // Current input, stored in the high |bits_available| bits of |bits|.
275 uint32 bits = 0; local
277 bool peeked_success = in->PeekBits(&bits_available, &bits);
281 uint32 index = bits >> (32 - kDecodeTableRootBits)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/modules/websockets/
WebSocketPerMessageDeflate.cpp 128 int bits = serverMaxWindowBits->value.toIntStrict(&ok); local
129 if (!ok || bits < 8 || bits > 15 || serverMaxWindowBits->value[0] == '+' || serverMaxWindowBits->value[0] == '0') {
  /external/chromium_org/third_party/icu/source/common/
bmpset.cpp 60 * Set bits in a bit rectangle in "vertical" bit organization.
68 uint32_t bits=(uint32_t)1<<lead; local
70 table[trail]|=bits;
80 table[trail++]|=bits;
88 table[trail++]|=bits;
93 bits=~((1<<lead)-1);
95 bits&=(1<<limitLead)-1;
98 table[trail]|=bits;
101 bits=1<<limitLead;
103 table[trail]|=bits;
200 uint32_t bits, mask; local
    [all...]
  /external/chromium_org/third_party/libaddressinput/chromium/cpp/src/util/
md5.cc 37 uint32 bits[2]; member in struct:__anon16196::Context
168 ctx->bits[0] = 0;
169 ctx->bits[1] = 0;
185 t = ctx->bits[0];
186 if ((ctx->bits[0] = t + ((uint32)len << 3)) < t)
187 ctx->bits[1]++; /* Carry from low to high */
188 ctx->bits[1] += static_cast<uint32>(len >> 29);
226 * 1 0* (64-bit count of bits processed, MSB-first)
234 count = (ctx->bits[0] >> 3) & 0x3F;
259 /* Append length in bits and transform *
    [all...]
  /external/chromium_org/third_party/libaddressinput/src/cpp/src/util/
md5.cc 37 uint32 bits[2]; member in struct:__anon16245::Context
168 ctx->bits[0] = 0;
169 ctx->bits[1] = 0;
185 t = ctx->bits[0];
186 if ((ctx->bits[0] = t + ((uint32)len << 3)) < t)
187 ctx->bits[1]++; /* Carry from low to high */
188 ctx->bits[1] += static_cast<uint32>(len >> 29);
226 * 1 0* (64-bit count of bits processed, MSB-first)
234 count = (ctx->bits[0] >> 3) & 0x3F;
259 /* Append length in bits and transform *
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_const.c 132 unsigned bits; local
155 /* FIXME: consider the fractional bits? */
156 bits = type.width / 2 - 1;
158 bits = type.width - 1;
160 return (double)-((long long)1 << bits);
170 unsigned bits; local
190 bits = type.width / 2;
192 bits = type.width;
195 bits -= 1;
197 return (double)(((unsigned long long)1 << bits) - 1)
    [all...]
lp_bld_format_soa.c 115 assert(format_desc->block.bits <= type.width);
149 if (stop < format_desc->block.bits) {
179 unsigned bits = type.width - stop; local
180 LLVMValueRef bits_val = lp_build_const_int_vec(gallivm, type, bits);
189 unsigned bits = type.width - format_desc->channel[chan].size; local
190 LLVMValueRef bits_val = lp_build_const_int_vec(gallivm, type, bits);
325 format_desc->block.bits <= type.width &&
343 format_desc->block.bits,
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/vl/
vl_vlc.h 72 unsigned i, bits = util_logbase2(dst_size); local
83 for(i=0; i<(1 << (bits - src->entry.length)); ++i)
84 dst[src->bitcode >> (16 - bits) | i] = src->entry;
118 * fill the bit buffer, so that at least 32 bits are valid
193 * number of bits still valid in bit buffer
202 * number of bits left over all inbut buffers
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_util.cpp 278 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/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/
sp_tex_sample.h 81 } bits; member in union:sp_sampler_key
sp_tex_tile_cache.h 61 } bits; member in union:tex_tile_address
142 addr.bits.x = x / TILE_SIZE;
143 addr.bits.y = y / TILE_SIZE;
144 addr.bits.z = z;
145 addr.bits.face = face;
146 addr.bits.level = level;
sp_tile_cache.h 58 } bits; member in union:tile_address
141 addr.bits.x = x / TILE_SIZE;
142 addr.bits.y = y / TILE_SIZE;
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/common/
utils.c 132 * \c GL_UNSIGNED_SHORT_5_6_5_REV is specified with \c GL_RGB, bits [15:11]
133 * are the blue value, bits [10:5] are the green value, and bits [4:0] are
141 * still uses 32-bits.
248 const uint8_t * bits; local
314 bits = bits_table[0];
317 bits = bits_table[1];
320 bits = ((fb_format == GL_RGB) || (fb_format == GL_BGR))
341 modes->redBits = bits[0];
342 modes->greenBits = bits[1]
    [all...]

Completed in 1910 milliseconds

<<11121314151617181920>>