Searched refs:lengths (Results 1 - 25 of 40) sorted by relevance

12

/external/zlib/src/contrib/puff/
H A Dpuff.c52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Gailly]
93 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
212 * a negative value if there is an error. If all of the lengths are zero, i.e.
219 * a simple integer ordering of codes of the same lengths. Hence below the
308 * Given the list of code lengths length[0..n-1] representing a canonical
319 * codes past the end of the incomplete lengths.
350 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
354 /* check for an over-subscribed or incomplete set of lengths */
392 * - Literals, lengths, and the end-of-block code are combined into a single
396 * - There are 256 possible lengths (
545 short lengths[FIXLCODES]; local
669 short lengths[MAXCODES]; /* descriptor code lengths */ local
[all...]
/external/libvorbis/vq/
H A Dbookutil.h39 extern void build_tree_from_lengths(int vals, long *hist, long *lengths);
40 extern void build_tree_from_lengths0(int vals, long *hist, long *lengths);
H A Dlatticetune.c31 LSP fitting, then generates new codeword lengths for maximally
42 long *lengths; local
85 lengths=_ogg_calloc(entries,sizeof(long));
132 /* build the codeword lengths */
133 build_tree_from_lengths0(entries,hits,lengths);
135 c->lengthlist=lengths;
H A Dhuffbuild.c131 long *lengths=_ogg_calloc(vals,sizeof(long)); local
149 build_tree_from_lengths0(vals,hist,lengths);
169 fprintf(file,"%2ld,",lengths[j]);
H A Dbookutil.c338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ argument
346 /* find codeword lengths */
377 lengths[j]++;
392 bitsum+=(histsave[i]-1)*lengths[i];
407 void build_tree_from_lengths0(int vals, long *hist, long *lengths){ argument
410 the lengths after the build */
430 lengths[i]=lengthlist[upper++];
432 lengths[i]=0;
/external/qemu/block/
H A Ddmg.c33 * lengths[i] is the length of the compressed chunk,
42 uint64_t* lengths; member in struct:BDRVDMGState
85 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL;
132 s->lengths = qemu_realloc(s->lengths, new_size);
141 last_in_offset = s->offsets[i-1]+s->lengths[i-1];
160 s->lengths[i] = read_off(bs, offset);
163 if(s->lengths[i]>max_compressed_size)
164 max_compressed_size = s->lengths[i];
232 s->compressed_chunk+i, s->lengths[chun
[all...]
/external/openssl/apps/
H A Dspeed.c259 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
1304 c[D_MD2][i]=c[D_MD2][0]*4*lengths[0]/lengths[i];
1305 c[D_MDC2][i]=c[D_MDC2][0]*4*lengths[0]/lengths[i];
1306 c[D_MD4][i]=c[D_MD4][0]*4*lengths[0]/lengths[i];
1307 c[D_MD5][i]=c[D_MD5][0]*4*lengths[0]/lengths[i];
1308 c[D_HMAC][i]=c[D_HMAC][0]*4*lengths[
[all...]
/external/icu4c/common/
H A Dtriedict.h82 * @param lengths An array that is filled with the lengths of words that matched.
83 * @param count Filled with the number of elements output in lengths.
84 * @param limit The size of the lengths array; this limits the number of words output.
89 int32_t *lengths,
155 * @param lengths An array that is filled with the lengths of words that matched.
156 * @param count Filled with the number of elements output in lengths.
157 * @param limit The size of the lengths array; this limits the number of words output.
162 int32_t *lengths,
[all...]
H A Ddictbe.cpp109 // list of word candidate lengths, in increasing length order
110 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord
153 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0]));
160 utext_setNativeIndex(text, start+lengths[count-1]);
169 utext_setNativeIndex(text, offset + lengths[mark]);
170 return lengths[mark];
176 utext_setNativeIndex(text, offset + lengths[--current]);
H A Dunames.c526 * expandGroupLengths() reads a block of compressed lengths of 32 strings and
527 * expands them into offsets and lengths for each string.
532 * The offsets and lengths arrays must be at least 33 (one more) long because
537 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) {
538 /* read the lengths of the 32 strings in this group and get each string's offset */
542 /* all 32 lengths must be read to get the offset of the first group string */
561 *lengths++=length;
573 *lengths++=length;
591 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
593 s=expandGroupLengths(s, offsets, lengths);
536 expandGroupLengths(const uint8_t *s, uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) argument
624 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1352 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
2004 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; local
[all...]
H A Dtriedict.cpp112 int32_t *lengths,
145 lengths[mycount++] = i+1;
220 int32_t *lengths,
225 return search(text, maxLength, lengths, count, limit, parent, pMatched);
467 int32_t *lengths,
480 lengths[mycount++] = i;
110 search( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit, TernaryNode *&parent, UBool &pMatched ) const argument
218 matches( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit ) const argument
465 matches( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit ) const argument
/external/skia/src/animator/
H A DSkGetCondensedInfo.cpp22 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char target[]) { argument
27 if (strcmp(&strings[lengths[mid << 2]], target) < 0)
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
/external/v8/test/mjsunit/
H A Dstring-indexof-1.js116 var lengths = [1, 4, 15]; // Single char, simple and complex. variable
118 for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
119 var length = lengths[lengthIndex];
/external/icu4c/test/perf/dicttrieperf/
H A Ddicttrieperf.cpp216 // Prime the prefix lengths so that we don't keep prefixLength at 0 until
368 int32_t lengths[20]; local
379 lengths, count, LENGTHOF(lengths));
380 if(count==0 || lengths[count-1]!=lines[i].len) {
399 int32_t *lengths, int &count, int limit ) {
415 // lengths[count++]=(int32_t)utext_getNativeIndex(text);
416 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too.
492 int32_t lengths[20]; local
503 lengths, coun
397 ucharsTrieMatches(UCharsTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) argument
596 bytesTrieMatches(BytesTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) argument
641 int32_t lengths[20]; local
[all...]
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/
H A DField.java224 List<Integer> lengths = new ArrayList<Integer>(3);//3 dimensions will be enough in most cases
233 lengths.add(Integer.valueOf(nameBuilder.substring(tableStartIndex + 1, tableStopIndex)));
240 if (!lengths.isEmpty()) {
241 tableSizes = new int[lengths.size()];
243 tableSizes[i] = lengths.get(i).intValue();
H A DDnaBlockData.java106 //reading lengths
113 int[] lengths = new int[amount];//theamount is the same as int types
115 lengths[i] = inputStream.readShort();
/external/okhttp/src/main/java/libcore/io/
H A DDiskLruCache.java131 * and may be read. A publish line is followed by the lengths of each of
300 size += entry.lengths[t];
469 long oldLength = entry.lengths[i];
471 entry.lengths[i] = newLength;
526 size -= entry.lengths[i];
527 entry.lengths[i] = 0;
781 private final long[] lengths; field in class:DiskLruCache.Entry
794 this.lengths = new long[valueCount];
799 for (long size : lengths) {
806 * Set lengths usin
[all...]
/external/skia/src/gpu/gl/
H A DGrGLProgram.cpp1043 LengthArray* lengths) {
1047 lengths->push_back(length);
1049 GrAssert(strings->count() == lengths->count());
1055 LengthArray* lengths,
1058 append_string(temp->back(), strings, lengths);
1069 PREALLOC_LENGTH_ARRAY(kPreAllocStringCnt) lengths;
1076 append_string(segments.fHeader, &strs, &lengths);
1077 append_decls(segments.fVSUnis, gl, &strs, &lengths, &temps);
1078 append_decls(segments.fVSAttrs, gl, &strs, &lengths, &temps);
1079 append_decls(segments.fVSOutputs, gl, &strs, &lengths,
1041 append_string(const GrStringBuilder& str, StrArray* strings, LengthArray* lengths) argument
1052 append_decls(const VarArray& vars, const GrGLContextInfo& gl, StrArray* strings, LengthArray* lengths, TempArray* temp) argument
[all...]
/external/mtpd/
H A Dpptp.c58 static uint8_t lengths[] = { variable
136 uint16_t length = lengths[message];
272 if (incoming.length < lengths[incoming.message]) {
/external/valgrind/main/memcheck/tests/
H A Dvarinfo6.stdout.exp9 bytes: mapping 19, selectors 66, code lengths 134, codes 6465
H A Dorigin5-bz2.stdout.exp10 bytes: mapping 19, selectors 66, code lengths 134, codes 6465
/external/webkit/Source/WebCore/platform/text/
H A DTextCodecUTF8.cpp67 static const uint8_t lengths[256] = { local
85 return lengths[firstByte];
/external/v8/test/cctest/
H A Dtest-strings.cc325 const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11}; local
338 CHECK_EQ(lengths[i], written);
341 for (int j = 0; j < lengths[i]; j++)
344 for (int j = lengths[i]; j < 11; j++)
356 // Make sure we cover all always-flat lengths and at least one above.
/external/tcpdump/
H A Dutil.c213 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local
215 const char **l = lengths;
/external/valgrind/main/exp-sgcheck/tests/
H A Dhackedbz2.stdout.exp9 bytes: mapping 19, selectors 66, code lengths 134, codes 6465

Completed in 7237 milliseconds

12