Searched defs:length (Results 1 - 25 of 4032) sorted by last modified time

1234567891011>>

/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...
/external/zlib/src/contrib/blast/
H A Dblast.c33 #define MAXBITS 13 /* maximum code length */
94 * each length, which for a canonical code are stepped through in order.
100 short *count; /* number of symbols of each length */
118 * - The first code for the shortest length is all ones. Subsequent codes of
119 * the same length are simply integer decrements of the previous code. When
120 * moving up a length, a one bit is appended to the code. For a complete
121 * code, the last code of the longest length will be all zeros. To support
129 int first; /* first code of length len */
130 int count; /* number of codes of length len */
131 int index; /* index of first code of length le
193 short length[256]; /* code lengths */ local
[all...]
/external/zlib/src/contrib/dotzlib/DotZLib/
H A DChecksumImpl.cs61 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
109 private static extern uint crc32(uint crc, int data, uint length); argument
130 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
160 private static extern uint adler32(uint adler, int data, uint length); argument
181 /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
H A DGZipStream.cs27 private static extern int gzwrite(IntPtr gzFile, int data, int length); argument
30 private static extern int gzread(IntPtr gzFile, int data, int length); argument
237 #region Position & length stuff
/external/zlib/src/contrib/infback9/
H A Dinfback9.c48 Build and output length and distance decoding tables for fixed code
61 /* literal/length table */
236 unsigned long length; /* literal or length of data to copy */ local
240 code const FAR *lencode; /* starting table for length/literal codes */
246 unsigned len; /* length to copy for repeats, bits to drop */
313 /* get and verify stored block length */
321 length = (unsigned)hold & 0xffff;
322 Tracev((stderr, "inflate: stored length %lu\n",
323 length));
[all...]
/external/zlib/src/contrib/puff/
H A Dpuff.c77 * - Allow incomplete code only if single code length is 1
79 * 2.3 21 Jan 2013 - Check for invalid code length codes in dynamic blocks
92 #define MAXLCODES 286 /* maximum number of literal/length codes */
95 #define FIXLCODES 288 /* number of fixed literal/length codes */
152 * - After the two-bit stored block type (00), the stored block length and
158 * - The second inverted copy of the stored block length does not have to be
161 * - A stored block can have zero length. This is sometimes used to byte-align
166 unsigned len; /* length of stored block */
172 /* get length and check against its one's complement */
201 * each length, whic
340 construct(struct huffman *h, const short *length, int n) argument
[all...]
/external/zlib/src/examples/
H A Denough.c2 * all possible valid and complete Huffman codes, subject to a length limit.
24 maximum code length in bits to determine the maximum table size for zilb's
28 length are not identical. So permutations of the symbol assignments result
33 are coded at each length. At each step, we have how many symbols remain to
34 be coded, what the last code length used was, and how many bit patterns of
35 that length remain unused. Then we add one to the code length and double the
36 number of unused patterns to graduate to the next code length. We then
37 assign all portions of the remaining symbols to that code length that
45 in length (roo
263 size_t length; /* length of the bit vector in bytes */ local
[all...]
/external/zlib/src/
H A Dinflate.h25 EXLEN, /* i: waiting for extra length (gzip) */
34 STORED, /* i: waiting for stored size (length and complement) */
38 LENLENS, /* i: waiting for code length code lengths */
39 CODELENS, /* i: waiting for length/lit and distance code lengths */
41 LEN, /* i: waiting for length/lit/eob code */
42 LENEXT, /* i: waiting for length extra bits */
48 LENGTH, /* i: waiting for 32-bit length (gzip) */
101 unsigned length; /* literal or length of data to copy */ member in struct:inflate_state
106 code const FAR *lencode; /* starting table for length/litera
[all...]
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 */
68 local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
73 /* The lengths of the bit length codes are sent in order of decreasing
74 * probability, to avoid transmitting the lengths for unused bit length codes.
105 /* length code for each normalized match length (
240 int length; /* length value */ local
[all...]
/external/zopfli/src/zopfli/
H A Dblocksplitter.c98 tree and the size to encode all literal, length and distance symbols and their
162 size_t length = dists[i] == 0 ? 1 : litlens[i]; local
167 pos += length;
318 size_t length = store.dists[i] == 0 ? 1 : store.litlens[i]; local
323 pos += length;
H A Dcache.c30 lmc->length = (unsigned short*)malloc(sizeof(unsigned short) * blocksize);
35 /* length > 0 and dist 0 is invalid combination, which indicates on purpose
37 for (i = 0; i < blocksize; i++) lmc->length[i] = 1;
43 free(lmc->length);
49 size_t pos, size_t length,
61 if (length < 3) return;
62 for (i = 3; i <= length; i++) {
63 if (i == length || sublen[i] != sublen[i + 1]) {
73 assert(bestlength == length);
76 assert(bestlength <= length);
48 ZopfliSublenToCache(const unsigned short* sublen, size_t pos, size_t length, ZopfliLongestMatchCache* lmc) argument
81 ZopfliCacheToSublen(const ZopfliLongestMatchCache* lmc, size_t pos, size_t length, unsigned short* sublen) argument
94 unsigned length = cache[j * 3] + 3; local
107 ZopfliMaxCachedSublen(const ZopfliLongestMatchCache* lmc, size_t pos, size_t length) argument
[all...]
H A Dcache.h32 Cache used by ZopfliFindLongestMatch to remember previously found length/dist
37 to every possible shorter-than-the-best length (the so called "sublen" array).
40 unsigned short* length; member in struct:ZopfliLongestMatchCache
53 size_t pos, size_t length,
58 size_t pos, size_t length,
60 /* Returns the length up to which could be stored in the cache. */
62 size_t pos, size_t length);
H A Ddeflate.c45 static void AddBits(unsigned symbol, unsigned length, argument
49 for (i = 0; i < length; i++) {
61 static void AddHuffmanBits(unsigned symbol, unsigned length, argument
66 for (i = 0; i < length; i++) {
67 unsigned bit = (symbol >> (length - i - 1)) & 1;
77 distance code (with length > 0), even though it's valid according to the
110 unsigned lld_total; /* Total amount of literal, length, distance codes. */
122 unsigned clcl[19]; /* Code length code lengths. */
124 /* The order in which code length code lengths are encoded as per deflate. */
141 /* This is an encoding of a huffman tree, so now the length i
381 OptimizeHuffmanForRle(int length, size_t* counts) argument
[all...]
H A Dlz77.c56 Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store.
59 void ZopfliStoreLitLenDist(unsigned short length, unsigned short dist, argument
62 ZOPFLI_APPEND_DATA(length, &store->litlens, &store->size);
67 Gets a score of the length given the distance. Typically, the score of the
68 length is the length itself, but if the distance is very long, decrease the
69 score of the length a bit to make up for the fact that long distances use large
77 -avoid using a length of 3 in combination with a long distance. This only has
78 an effect if length == 3.
87 static int GetLengthScore(int length, in argument
95 ZopfliVerifyLenDist(const unsigned char* data, size_t datasize, size_t pos, unsigned short dist, unsigned short length) argument
162 TryGetFromLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t* limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument
206 StoreInLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t limit, const unsigned short* sublen, unsigned short distance, unsigned short length) argument
229 ZopfliFindLongestMatch(ZopfliBlockState* s, const ZopfliHash* h, const unsigned char* array, size_t pos, size_t size, size_t limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument
[all...]
H A Dsqueeze.c32 /* The literal and length symbols. */
112 litlen: means literal symbol if dist is 0, length otherwise.
132 cost += 5; /* Every dist symbol has length 5. */
155 Finds the minimum possible cost this cost model can return for valid length and
160 int bestlength = 0; /* length that has lowest cost in the cost model */
167 See RFC 1951 section 3.2.5. Compressed blocks (length and distance codes).
196 Performs the forward pass for "squeeze". Gets the most optimal length to reach
205 length to reach this byte from a previous byte.
255 /* Set the length to reach each one to ZOPFLI_MAX_MATCH, and the cost to
256 the cost corresponding to that length
357 unsigned short length = path[i]; local
[all...]
/external/zopfli/src/zopflipng/lodepng/
H A Dlodepng.cpp449 /*256 literals, the end code, some length codes, and 2 unused codes*/
453 /*the code length codes. 0-15: code lengths, 16: copy previous 3-6 times, 17: 3-10 zeros, 18: 11-138 zeros*/
461 /*the extra bits used by codes 257-285 (added to base length)*/
466 /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/
476 /*the order in which "code length alphabet code lengths" are stored, out of this
499 std::cout << "tree. length: " << tree->numcodes << " maxbitlen: " << tree->maxbitlen << std::endl;
540 (due to too long length codes), error 55 will happen
605 /*step 1: count number of instances of each code length*/
862 /*get the literal and length code tree of a deflated block with fixed tree, as per the deflate specification*/
900 inbitlength is the length o
1118 size_t start, forward, backward, length; local
1314 addLengthDistance(uivector* values, size_t length, size_t distance) argument
1444 unsigned length; local
2407 unsigned length = lodepng_chunk_length(chunk); local
2417 unsigned length = lodepng_chunk_length(chunk); local
2453 lodepng_chunk_create(unsigned char** out, size_t* outlength, unsigned length, const char* type, const unsigned char* data) argument
4008 unfilterScanline(unsigned char* recon, const unsigned char* scanline, const unsigned char* precon, size_t bytewidth, unsigned char filterType, size_t length) argument
4356 unsigned length, string2_begin; local
4882 addChunk(ucvector* out, const char* chunkName, const unsigned char* data, size_t length) argument
5158 filterScanline(unsigned char* out, const unsigned char* scanline, const unsigned char* prevline, size_t length, size_t bytewidth, unsigned char filterType) argument
[all...]
H A Dlodepng_util.cpp285 {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15}; //code length code lengths
314 //count number of instances of each code length
392 //the code tree for Huffman codes, dist codes, and code length codes
414 size_t HLIT = readBitsFromStream(bp, in, 5) + 257; //number of literal/length codes + 257
416 size_t HCLEN = readBitsFromStream(bp, in, 4) + 4; //number of code length codes + 4
422 //code length code lengths
430 if(code <= 15) { if(i < HLIT) bitlen[i++] = code; else bitlenD[i++ - HLIT] = code; } //a length code
468 if(bitlen[256] == 0) { error = 64; return; } //the length of the end code 256 must be larger than 0
504 else if(code >= 257 && code <= 285) //length code
506 size_t length local
[all...]
/external/webrtc/src/common_audio/signal_processing/
H A Dcopy_set_operations.c31 void WebRtcSpl_MemSetW16(WebRtc_Word16 *ptr, WebRtc_Word16 set_value, int length) argument
36 for (j = length; j > 0; j--)
42 void WebRtcSpl_MemSetW32(WebRtc_Word32 *ptr, WebRtc_Word32 set_value, int length) argument
47 for (j = length; j > 0; j--)
53 void WebRtcSpl_MemCpyReversedOrder(WebRtc_Word16* dest, WebRtc_Word16* source, int length) argument
59 for (j = 0; j < length; j++)
66 WebRtc_Word16 length,
71 WEBRTC_SPL_MEMCPY_W16(vector_out, &vector_in[length - samples], samples);
76 WebRtc_Word16 WebRtcSpl_ZerosArrayW16(WebRtc_Word16 *vector, WebRtc_Word16 length) argument
78 WebRtcSpl_MemSetW16(vector, 0, length);
65 WebRtcSpl_CopyFromEndW16(G_CONST WebRtc_Word16 *vector_in, WebRtc_Word16 length, WebRtc_Word16 samples, WebRtc_Word16 *vector_out) argument
82 WebRtcSpl_ZerosArrayW32(WebRtc_Word32 *vector, WebRtc_Word16 length) argument
88 WebRtcSpl_OnesArrayW16(WebRtc_Word16 *vector, WebRtc_Word16 length) argument
99 WebRtcSpl_OnesArrayW32(WebRtc_Word32 *vector, WebRtc_Word16 length) argument
[all...]
H A Ddot_product_with_scale.c21 int length, int scaling)
27 WebRtc_Word16 len4 = (length >> 2) << 2;
33 for (i = 0; i < length; i++)
56 for (i = len4; i < length; i++)
81 for (i = len4; i < length; i++)
20 WebRtcSpl_DotProductWithScale(WebRtc_Word16 *vector1, WebRtc_Word16 *vector2, int length, int scaling) argument
H A Dfilter_ar_fast_q12.c21 WebRtc_Word16 A_length, WebRtc_Word16 length)
29 for (i = 0; i < length; i++)
20 WebRtcSpl_FilterARFastQ12(WebRtc_Word16 *in, WebRtc_Word16 *out, WebRtc_Word16 *A, WebRtc_Word16 A_length, WebRtc_Word16 length) argument
H A Dfilter_ma_fast_q12.c24 WebRtc_Word16 length)
28 for (i = 0; i < length; i++)
20 WebRtcSpl_FilterMAFastQ12(WebRtc_Word16* in_ptr, WebRtc_Word16* out_ptr, WebRtc_Word16* B, WebRtc_Word16 B_length, WebRtc_Word16 length) argument
H A Dmin_max_operations.c34 WebRtc_Word16 WebRtcSpl_MaxAbsValueW16(const WebRtc_Word16 *vector, WebRtc_Word16 length) argument
42 for (i = 0; i < length; i++)
58 WebRtc_Word16 WebRtcSpl_MaxAbsIndexW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length) argument
68 for (i = 1; i < length; i++)
82 WebRtc_Word32 WebRtcSpl_MaxAbsValueW32(G_CONST WebRtc_Word32 *vector, WebRtc_Word16 length) argument
90 for (i = 0; i < length; i++)
105 WebRtc_Word16 WebRtcSpl_MaxValueW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length) argument
112 for (i = 1; i < length; i++)
124 WebRtc_Word16 WebRtcSpl_MaxIndexW16(G_CONST WebRtc_Word16 *vector, WebRtc_Word16 length) argument
132 for (i = 1; i < length;
145 WebRtcSpl_MaxValueW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length) argument
164 WebRtcSpl_MaxIndexW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length) argument
184 WebRtcSpl_MinValueW16(G_CONST WebRtc_Word16 *vector, WebRtc_Word16 length) argument
202 WebRtcSpl_MinIndexW16(G_CONST WebRtc_Word16* vector, WebRtc_Word16 length) argument
226 WebRtcSpl_MinValueW32(G_CONST WebRtc_Word32 *vector, WebRtc_Word16 length) argument
244 WebRtcSpl_MinIndexW32(G_CONST WebRtc_Word32* vector, WebRtc_Word16 length) argument
[all...]
H A Dmin_max_operations_neon.c19 WebRtc_Word16 length) {
27 for (i = 0; i < length - 7; i += 8) {
37 for (; i < length; i++) {
18 WebRtcSpl_MaxAbsValueW16(const WebRtc_Word16* vector, WebRtc_Word16 length) argument
H A Dvector_scaling_operations.c28 WebRtc_Word16 length,
36 for (i = length; i > 0; i--)
42 for (i = length; i > 0; i--)
72 WebRtc_Word16 length,
80 for (i = length; i > 0; i--)
87 for (i = length; i > 0; i--)
27 WebRtcSpl_VectorBitShiftW16(WebRtc_Word16 *res, WebRtc_Word16 length, G_CONST WebRtc_Word16 *in, WebRtc_Word16 right_shifts) argument
71 WebRtcSpl_VectorBitShiftW32ToW16(WebRtc_Word16 *res, WebRtc_Word16 length, G_CONST WebRtc_Word32 *in, WebRtc_Word16 right_shifts) argument
/external/webrtc/src/common_audio/vad/
H A Dvad_filterbank.c140 int length = frame_size; local
147 WebRtcVad_SplitFilter(in_ptr, length, &inst->upper_state[frequency_band],
156 length = WEBRTC_SPL_RSHIFT_W16(frame_size, 1);
158 WebRtcVad_SplitFilter(in_ptr, length, &inst->upper_state[frequency_band],
163 length = WEBRTC_SPL_RSHIFT_W16(length, 1);
164 WebRtcVad_LogOfEnergy(hp_60, length, kOffsetVector[5], &power,
168 WebRtcVad_LogOfEnergy(lp_60, length, kOffsetVector[4], &power,
176 length = WEBRTC_SPL_RSHIFT_W16(frame_size, 1);
177 WebRtcVad_SplitFilter(in_ptr, length,
[all...]

Completed in 3849 milliseconds

1234567891011>>