HomeSort by relevance Sort by last modified time
    Searched full:bits (Results 676 - 700 of 15847) sorted by null

<<21222324252627282930>>

  /external/libavc/encoder/
irc_vbr_storage_vbv.c 48 /* Error bits calculation module */
110 * Calculate the max number of bits that flow into the decoder
116 /* init error bits */
150 /* Update the error bits state */
172 * Thus for the next frame the maximum number of bits the decoder can consume
181 Inputs : Rate control API , header and texture bits
194 /* error bits due to fixed point computation of drain rate*/
327 * Calculate the max number of bits that flow into the decoder
344 * Calculate the max number of bits that flow into the decoder
362 * Calculate the max number of bits that flow into the decode
    [all...]
  /external/v8/src/arm64/
decoder-arm64.h 135 // On entry, instruction bits 27:24 = 0x0.
140 // On entry, instruction bits 27:24 = 0x1.
145 // On entry, instruction bits 27:24 = {0x4, 0x5, 0x6, 0x7}.
150 // On entry, instruction bits 27:24 = {0x8, 0x9, 0xC, 0xD}.
155 // On entry, instruction bits 27:24 = 0x2.
160 // On entry, instruction bits 27:24 = 0x3.
165 // On entry, instruction bits 27:24 = {0x1, 0xA, 0xB}.
170 // On entry, instruction bits 27:24 = {0xE, 0xF}.
175 // On entry, instruction bits 29:25 = 0x6.
180 // On entry, instruction bits 27:25 = 0x7
    [all...]
  /external/v8/src/base/
division-by-constant.cc 26 const unsigned bits = static_cast<unsigned>(sizeof(T)) * 8;
27 const T min = (static_cast<T>(1) << (bits - 1));
30 const T t = min + (d >> (bits - 1));
32 unsigned p = bits - 1; // Init. p.
55 return {neg ? (0 - mul) : mul, p - bits, false};
64 const unsigned bits = static_cast<unsigned>(sizeof(T)) * 8;
66 const T min = static_cast<T>(1) << (bits - 1);
70 unsigned p = bits - 1; // Init. p.
95 } while (p < bits * 2 && (q1 < delta || (q1 == delta && r1 == 0)));
96 return {q2 + 1, p - bits, a}
    [all...]
  /external/webp/src/utils/
bit_writer.h 30 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...]
  /hardware/intel/common/libva/va/
va_enc.h 140 * Writes an unsigned int value of the specified length in bits. The
141 * value is implicitly zero-extended to the number of specified bits.
145 * @param[in] length the length (in bits) of the value
146 * @return the number of bits written, or a negative value to indicate an error
154 * Writes a signed int value of the specified length in bits. The
155 * value is implicitly sign-extended to the number of specified bits.
159 * @param[in] length the length (in bits) of the value
160 * @return the number of bits written, or a negative value to indicate an error
174 * Align the bitstream to next byte boundary, while filling in bits
179 * @return the number of bits written, or a negative value to indicate an erro
    [all...]
  /external/chromium-trace/trace-viewer/third_party/webapp2/webapp2_extras/
security.py 50 - H is the entropy in bits.
59 HEXADECIMAL_DIGITS 16 4.0000 bits
60 DIGITS 10 3.3219 bits
61 LOWERCASE_ALPHA 26 4.7004 bits
62 UPPERCASE_ALPHA 26 4.7004 bits
63 PUNCTUATION 32 5.0000 bits
64 LOWERCASE_ALPHANUMERIC 36 5.1699 bits
65 UPPERCASE_ALPHANUMERIC 36 5.1699 bits
66 ALPHA 52 5.7004 bits
67 ALPHANUMERIC 62 5.9542 bits
    [all...]
  /external/flac/libFLAC/
bitreader.c 49 /* WATCHOUT: there are a few places where the code will not work unless uint32_t is >= 32 bits wide */
64 * read. With FLAC this is on the order of maybe a few hundred bits.
78 /* any partially-consumed word at the head will stay right-justified as bits are consumed from the left */
85 unsigned consumed_bits; /* ... + (#bits of head word) already consumed from the front of buffer */
87 unsigned crc16_align; /* the number of bits in the current consumed word that should not be CRC'd */
145 /* before reading, if the existing reader looks like this (say uint32_t is 32 bits wide)
276 fprintf(out, "bitreader: capacity=%u words=%u bytes=%u consumed: words=%u, bits=%u\n", br->capacity, br->words, br->bytes, br->consumed_words, br->consumed_bits);
340 FLAC__bool FLAC__bitreader_read_raw_uint32(FLAC__BitReader *br, FLAC__uint32 *val, unsigned bits)
345 FLAC__ASSERT(bits <= 32);
346 FLAC__ASSERT((br->capacity*FLAC__BITS_PER_WORD) * 2 >= bits);
378 *val <<= bits; local
    [all...]
  /external/jpeg/
jdct.h 31 typedef short DCTELEM; /* 16 or 32 bits is fine */
33 typedef int DCTELEM; /* 16 or 32 bits is fine */
36 typedef INT32 DCTELEM; /* must have 32 bits */
62 typedef MULTIPLIER IFAST_MULT_TYPE; /* 16 bits is OK, use short if faster */
63 #define IFAST_SCALE_BITS 2 /* fractional bits in scale factors */
65 typedef INT32 IFAST_MULT_TYPE; /* need 32 bits for scaled quantizers */
66 #define IFAST_SCALE_BITS 13 /* fractional bits in scale factors */
82 #define RANGE_MASK (MAXJSAMPLE * 4 + 3) /* 2 bits wider than legal samples */
130 * Fractional constants are scaled left by CONST_BITS bits.
145 /* Descale and correctly round an INT32 value that's scaled by N bits
    [all...]
  /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/
vbp_vc1_parser.c 742 pic_parms->sequence_fields.bits.interlace = seqLayerHeader->INTERLACE;
743 pic_parms->sequence_fields.bits.syncmarker = seqLayerHeader->SYNCMARKER;
744 pic_parms->sequence_fields.bits.overlap = seqLayerHeader->OVERLAP;
750 pic_parms->entrypoint_fields.bits.closed_entry = seqLayerHeader->CLOSED_ENTRY;
751 pic_parms->entrypoint_fields.bits.broken_link = seqLayerHeader->BROKEN_LINK;
752 pic_parms->entrypoint_fields.bits.loopfilter = seqLayerHeader->LOOPFILTER;
758 pic_parms->range_mapping_fields.bits.luma_flag = seqLayerHeader->RANGE_MAPY_FLAG;
759 pic_parms->range_mapping_fields.bits.luma = seqLayerHeader->RANGE_MAPY;
760 pic_parms->range_mapping_fields.bits.chroma_flag = seqLayerHeader->RANGE_MAPUV_FLAG;
761 pic_parms->range_mapping_fields.bits.chroma = seqLayerHeader->RANGE_MAPUV
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/
Nat.java 285 public static int[] fromBigInteger(int bits, BigInteger x)
287 if (x.signum() < 0 || x.bitLength() > bits)
292 int len = (bits + 31) >> 5;
586 public static int shiftDownBits(int len, int[] z, int bits, int c)
588 // assert bits > 0 && bits < 32;
593 z[i] = (next >>> bits) | (c << -bits);
596 return c << -bits;
599 public static int shiftDownBits(int len, int[] z, int zOff, int bits, int c
    [all...]
  /external/aac/libAACenc/src/
qc_data.h 143 INT maxBits; /* maximum number of bits in reservoir */
144 INT averageBits; /* average number of bits we should use */
148 INT staticBits; /* Bits per frame consumed by transport layers. */
157 INT minBits; /* minimal number of bits in one frame*/
224 INT maxDynBits; /* maximal allowed dynamic bits in frame */
225 INT grantedDynBits; /* granted dynamic bits in frame */
226 INT totFillBits; /* fill bits */
227 INT elementExtBits; /* element associated extension payload bits, e.g. sbr, drc ... */
228 INT globalExtBits; /* frame/au associated extension payload bits (anc data ...) */
229 INT staticBits; /* aac side info bits */
    [all...]
  /external/zlib/src/contrib/puff/
puff.c 19 * assumes that long's are at least 32 bits. puff.c uses the short data type,
20 * assumed to be 16 bits, for arrays in order to to conserve memory. The code
48 * are 16 bits
91 #define MAXBITS 15 /* maximum bits in a code */
109 int bitcnt; /* number of bits in bit buffer */
111 /* input limit error return state for bits() and decode() */
116 * Return need bits from the input stream. This always leaves less than
117 * eight bits in the buffer. bits() works properly for need == 0.
121 * - Bits are stored in bytes from the least significant bit to the mos
126 local int bits(struct state *s, int need) function
    [all...]
  /hardware/intel/img/psb_video/src/mrst/
lnc_hostheader.c 56 IMG_UINT32 Bits)
62 uiByteSize = (Bits + ByteStartBit + 7) >> 3;
67 if (Bcnt > Bits + ByteStartBit || Bcnt <= ByteStartBit)
101 drv_debug_msg(VIDEO_DEBUG_GENERAL, "Writing %i RAW bits to element.\n", elt_p[f]->Size);
147 drv_debug_msg(VIDEO_DEBUG_GENERAL, "No RAW bits\n\n");
173 /* This is the core function to write bits/bytes
193 /* First ensure that unused bits in wrt_bits are zeroed */
201 /* Pointer to the space where header bits are to be written */
202 wrt_bytes_p = &(elt_p[mtx_hdr->Elements]->Bits);
208 /* Element maximum bits send to element, time to start a new one *
    [all...]
  /external/boringssl/src/crypto/bn/
exponentiation.c 129 int i, bits, ret = 0; local
153 bits = BN_num_bits(p);
165 for (i = 1; i < bits; i++) {
393 * For window size 'w' (w >= 2) and a random 'b' bits exponent, the number of
421 int i, j, bits, ret = 0, wstart, window; local
434 bits = BN_num_bits(p);
436 if (bits == 0) {
473 window = BN_window_bits_for_exponent_size(bits);
490 wstart = bits - 1; /* The top bit of the window */
574 * 4096, 8192 bits], compared to the running time of th
606 int i, j, bits, ret = 0, wstart, window; local
855 int i, bits, ret = 0, window, wvalue; local
1207 int b, bits, ret = 0; local
1365 int i, j, bits, b, bits1, bits2, ret = 0, wpos1, wpos2, window1, window2, local
    [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);
  /development/ndk/platforms/android-3/include/linux/
nodemask.h 20 typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
26 #define node_isset(node, nodemask) test_bit((node), (nodemask).bits)
43 #define nodemask_of_node(node) ({ typeof(_unused_nodemask_arg_) m; if (sizeof(m) == sizeof(unsigned long)) { m.bits[0] = 1UL<<(node); } else { nodes_clear(m); node_set((node), m); } m; })
52 #define nodes_addr(src) ((src).bits)
83 #define node_set_online(node) set_bit((node), node_online_map.bits)
84 #define node_set_offline(node) clear_bit((node), node_online_map.bits)
  /external/antlr/antlr-3.4/runtime/C/include/
antlr3bitset.h 43 /** How many bits in the elements
47 /** How many bits in a nible of bits
71 /// Pointer to the allocated array of bits for this bit set, which
79 pANTLR3_BITWORD bits; member in struct:ANTLR3_BITSET_LIST_struct
89 /// The actual bits themselves
  /external/apache-commons-math/src/main/java/org/apache/commons/math/random/
Well1024a.java 40 /** Number of bits in the pool. */
61 * @param seed the initial seed (32 bits integer)
68 * @param seed the initial seed (32 bits integers array), if null
76 * @param seed the initial seed (64 bits integer)
84 protected int next(final int bits) {
103 return z4 >>> (32 - bits);
Well19937a.java 40 /** Number of bits in the pool. */
61 * @param seed the initial seed (32 bits integer)
68 * @param seed the initial seed (32 bits integers array), if null
76 * @param seed the initial seed (64 bits integer)
84 protected int next(final int bits) {
105 return z4 >>> (32 - bits);
Well512a.java 40 /** Number of bits in the pool. */
61 * @param seed the initial seed (32 bits integer)
68 * @param seed the initial seed (32 bits integers array), if null
76 * @param seed the initial seed (64 bits integer)
84 protected int next(final int bits) {
103 return z4 >>> (32 - bits);
  /external/compiler-rt/lib/builtins/
floatdisf.c 43 * P = bit FLT_MANT_DIG-1 bits to the right of 1
44 * Q = bit FLT_MANT_DIG bits to the right of 1
45 * R = "or" of all bits to the right of Q
62 /* a is now rounded to FLT_MANT_DIG or FLT_MANT_DIG+1 bits */
68 /* a is now rounded to FLT_MANT_DIG bits */
73 /* a is now rounded to FLT_MANT_DIG bits */
floattidf.c 43 * P = bit DBL_MANT_DIG-1 bits to the right of 1
44 * Q = bit DBL_MANT_DIG bits to the right of 1
45 * R = "or" of all bits to the right of Q
62 /* a is now rounded to DBL_MANT_DIG or DBL_MANT_DIG+1 bits */
68 /* a is now rounded to DBL_MANT_DIG bits */
73 /* a is now rounded to DBL_MANT_DIG bits */
floattisf.c 43 * P = bit FLT_MANT_DIG-1 bits to the right of 1
44 * Q = bit FLT_MANT_DIG bits to the right of 1
45 * R = "or" of all bits to the right of Q
62 /* a is now rounded to FLT_MANT_DIG or FLT_MANT_DIG+1 bits */
68 /* a is now rounded to FLT_MANT_DIG bits */
73 /* a is now rounded to FLT_MANT_DIG bits */
floatundisf.c 41 * P = bit FLT_MANT_DIG-1 bits to the right of 1
42 * Q = bit FLT_MANT_DIG bits to the right of 1
43 * R = "or" of all bits to the right of Q
60 /* a is now rounded to FLT_MANT_DIG or FLT_MANT_DIG+1 bits */
66 /* a is now rounded to FLT_MANT_DIG bits */
71 /* a is now rounded to FLT_MANT_DIG bits */
floatuntidf.c 41 * P = bit DBL_MANT_DIG-1 bits to the right of 1
42 * Q = bit DBL_MANT_DIG bits to the right of 1
43 * R = "or" of all bits to the right of Q
60 /* a is now rounded to DBL_MANT_DIG or DBL_MANT_DIG+1 bits */
66 /* a is now rounded to DBL_MANT_DIG bits */
71 /* a is now rounded to DBL_MANT_DIG bits */

Completed in 815 milliseconds

<<21222324252627282930>>