Home
last modified time | relevance | path

Searched refs:lengths (Results 1 – 25 of 98) sorted by relevance

1234

/external/zlib/src/contrib/puff/
Dpuff.c545 short lengths[FIXLCODES]; in fixed() local
555 lengths[symbol] = 8; in fixed()
557 lengths[symbol] = 9; in fixed()
559 lengths[symbol] = 7; in fixed()
561 lengths[symbol] = 8; in fixed()
562 construct(&lencode, lengths, FIXLCODES); in fixed()
566 lengths[symbol] = 5; in fixed()
567 construct(&distcode, lengths, MAXDCODES); in fixed()
669 short lengths[MAXCODES]; /* descriptor code lengths */ in dynamic() local
691 lengths[order[index]] = bits(s, 3); in dynamic()
[all …]
/external/openssl/apps/
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]; in MAIN()
1305 c[D_MDC2][i]=c[D_MDC2][0]*4*lengths[0]/lengths[i]; in MAIN()
1306 c[D_MD4][i]=c[D_MD4][0]*4*lengths[0]/lengths[i]; in MAIN()
1307 c[D_MD5][i]=c[D_MD5][0]*4*lengths[0]/lengths[i]; in MAIN()
1308 c[D_HMAC][i]=c[D_HMAC][0]*4*lengths[0]/lengths[i]; in MAIN()
1309 c[D_SHA1][i]=c[D_SHA1][0]*4*lengths[0]/lengths[i]; in MAIN()
1310 c[D_RMD160][i]=c[D_RMD160][0]*4*lengths[0]/lengths[i]; in MAIN()
1311 c[D_SHA256][i]=c[D_SHA256][0]*4*lengths[0]/lengths[i]; in MAIN()
1312 c[D_SHA512][i]=c[D_SHA512][0]*4*lengths[0]/lengths[i]; in MAIN()
[all …]
/external/qemu/block/
Ddmg.c42 uint64_t* lengths; member
85 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL; in dmg_open()
132 s->lengths = qemu_realloc(s->lengths, new_size); in dmg_open()
141 last_in_offset = s->offsets[i-1]+s->lengths[i-1]; in dmg_open()
160 s->lengths[i] = read_off(bs, offset); in dmg_open()
163 if(s->lengths[i]>max_compressed_size) in dmg_open()
164 max_compressed_size = s->lengths[i]; in dmg_open()
232 s->compressed_chunk+i, s->lengths[chunk]-i); in dmg_read_chunk()
236 } while(ret>=0 && ret+i<s->lengths[chunk]); in dmg_read_chunk()
238 if (ret != s->lengths[chunk]) in dmg_read_chunk()
[all …]
/external/marisa-trie/tests/
Dtrie-test.cc139 std::vector<std::size_t> lengths; in TestTrie() local
140 ASSERT(trie.find("Baddie", &ids, &lengths) == 1); in TestTrie()
143 ASSERT(lengths.size() == 1); in TestTrie()
144 ASSERT(lengths[0] == 3); in TestTrie()
146 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1); in TestTrie()
149 ASSERT(lengths.size() == 2); in TestTrie()
150 ASSERT(lengths[1] == 3); in TestTrie()
337 std::vector<std::size_t> lengths; in TestPrefixTrie() local
338 ASSERT(trie.find("card", &ids, &lengths) == 1); in TestPrefixTrie()
341 ASSERT(lengths.size() == 1); in TestPrefixTrie()
[all …]
/external/marisa-trie/v0_1_5/tests/
Dtrie-test.cc141 std::vector<std::size_t> lengths; in TestTrie() local
142 ASSERT(trie.find("Baddie", &ids, &lengths) == 1); in TestTrie()
145 ASSERT(lengths.size() == 1); in TestTrie()
146 ASSERT(lengths[0] == 3); in TestTrie()
148 ASSERT(trie.find_callback("anderson", FindCallback(&ids, &lengths)) == 1); in TestTrie()
151 ASSERT(lengths.size() == 2); in TestTrie()
152 ASSERT(lengths[1] == 3); in TestTrie()
339 std::vector<std::size_t> lengths; in TestPrefixTrie() local
340 ASSERT(trie.find("card", &ids, &lengths) == 1); in TestPrefixTrie()
343 ASSERT(lengths.size() == 1); in TestPrefixTrie()
[all …]
/external/icu4c/common/
Ddictbe.cpp104 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in PossibleWord
147 … prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0])); in candidates()
154 utext_setNativeIndex(text, start+lengths[count-1]); in candidates()
163 utext_setNativeIndex(text, offset + lengths[mark]); in acceptMarked()
164 return lengths[mark]; in acceptMarked()
170 utext_setNativeIndex(text, offset + lengths[--current]); in backUp()
839 AutoBuffer<int32_t, maxWordSize> lengths(numChars); in divideUpDictionaryRange() local
853 …fDictionary->matches(&normalizedText, maxSearchLength, lengths.elems(), count, maxSearchLength, va… in divideUpDictionaryRange()
860 if((count == 0 || lengths[0] != 1) && in divideUpDictionaryRange()
863 lengths[count++] = 1; in divideUpDictionaryRange()
[all …]
Ddictionarydata.h71 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
84 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
101 virtual int32_t matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &count,
Ddictionarydata.cpp38 int32_t UCharsDictionaryMatcher::matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t … in matches() argument
53 lengths[count++] = numChars; in matches()
102 int32_t BytesDictionaryMatcher::matches(UText *text, int32_t maxLength, int32_t *lengths, int32_t &… in matches() argument
117 lengths[count++] = numChars; in matches()
Dunames.cpp539 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) { in expandGroupLengths()
563 *lengths++=length; in expandGroupLengths()
575 *lengths++=length; in expandGroupLengths()
593 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; in expandGroupName() local
595 s=expandGroupLengths(s, offsets, lengths); in expandGroupName()
596 return expandName(names, s+offsets[lineNumber], lengths[lineNumber], nameChoice, in expandGroupName()
626 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; in enumGroupNames() local
629 s=expandGroupLengths(s, offsets, lengths); in enumGroupNames()
635 …length=expandName(names, s+offsets[start&GROUP_MASK], lengths[start&GROUP_MASK], nameChoice, buffe… in enumGroupNames()
650 …if(compareName(names, s+offsets[start&GROUP_MASK], lengths[start&GROUP_MASK], nameChoice, otherNam… in enumGroupNames()
[all …]
/external/icu4c/test/perf/dicttrieperf/
Ddicttrieperf.cpp348 int32_t *lengths, int &count, int limit ) { in ucharsTrieMatches() argument
365 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too. in ucharsTrieMatches()
441 int32_t lengths[20]; in call() local
452 lengths, count, LENGTHOF(lengths)); in call()
453 if(count==0 || lengths[count-1]!=lines[i].len) { in call()
547 int32_t *lengths, int &count, int limit ) { in bytesTrieMatches() argument
559 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too. in bytesTrieMatches()
590 int32_t lengths[20]; in call() local
601 lengths, count, LENGTHOF(lengths)); in call()
602 if(count==0 || lengths[count-1]!=lines[i].len) { in call()
/external/libvorbis/vq/
Dlatticetune.c42 long *lengths; in main() local
85 lengths=_ogg_calloc(entries,sizeof(long)); in main()
133 build_tree_from_lengths0(entries,hits,lengths); in main()
135 c->lengthlist=lengths; in main()
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);
Dhuffbuild.c131 long *lengths=_ogg_calloc(vals,sizeof(long)); in main() local
149 build_tree_from_lengths0(vals,hist,lengths); in main()
169 fprintf(file,"%2ld,",lengths[j]); in main()
Dbookutil.c338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ in build_tree_from_lengths() argument
377 lengths[j]++; in build_tree_from_lengths()
392 bitsum+=(histsave[i]-1)*lengths[i]; in build_tree_from_lengths()
407 void build_tree_from_lengths0(int vals, long *hist, long *lengths){ in build_tree_from_lengths0() argument
430 lengths[i]=lengthlist[upper++]; in build_tree_from_lengths0()
432 lengths[i]=0; in build_tree_from_lengths0()
/external/marisa-trie/v0_1_5/tools/
Dmarisa_alpha-find.cc41 static std::vector<std::size_t> lengths; in find_all() local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); in find_all()
47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n'; in find_all()
53 lengths.clear(); in find_all()
/external/marisa-trie/tools/
Dmarisa-find.cc41 static std::vector<std::size_t> lengths; in find_all() local
42 const std::size_t num_keys = trie.find(str, &key_ids, &lengths); in find_all()
47 std::cout.write(str.c_str(), lengths[i]) << '\t' << str << '\n'; in find_all()
53 lengths.clear(); in find_all()
/external/skia/src/animator/
DSkGetCondensedInfo.cpp22 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char t… in _searchByName() argument
27 if (strcmp(&strings[lengths[mid << 2]], target) < 0) in _searchByName()
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0) in _searchByName()
/external/v8/test/mjsunit/
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/skia/legacy/src/animator/
DSkGetCondensedInfo.cpp22 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char t… in _searchByName() argument
27 if (strcmp(&strings[lengths[mid << 2]], target) < 0) in _searchByName()
32 if (strcmp(&strings[lengths[hi << 2]], target) != 0) in _searchByName()
/external/okhttp/src/main/java/com/squareup/okhttp/internal/
DDiskLruCache.java305 size += entry.lengths[t]; in processJournal()
475 long oldLength = entry.lengths[i]; in completeEdit()
477 entry.lengths[i] = newLength; in completeEdit()
531 size -= entry.lengths[i]; in remove()
532 entry.lengths[i] = 0; in remove()
775 private final long[] lengths; field in DiskLruCache.Entry
788 this.lengths = new long[valueCount]; in Entry()
793 for (long size : lengths) { in getLengths()
807 lengths[i] = Long.parseLong(strings[i]); in setLengths()
/external/jmonkeyengine/engine/src/blender/com/jme3/scene/plugins/blender/file/
DField.java224 … List<Integer> lengths = new ArrayList<Integer>(3);//3 dimensions will be enough in most cases in parseField() local
233 … lengths.add(Integer.valueOf(nameBuilder.substring(tableStartIndex + 1, tableStopIndex))); in parseField()
240 if (!lengths.isEmpty()) { in parseField()
241 tableSizes = new int[lengths.size()]; in parseField()
243 tableSizes[i] = lengths.get(i).intValue(); in parseField()
DDnaBlockData.java113 int[] lengths = new int[amount];//theamount is the same as int types in DnaBlockData() local
115 lengths[i] = inputStream.readShort(); in DnaBlockData()
/external/zlib/src/doc/
Drfc1951.txt207 "deflate" format limits distances to 32K bytes and lengths to 258
211 Each type of value (literals, distances, and lengths) in the
213 tree for literals and lengths and a separate code tree for distances.
289 lengths, not a sequence of bytes. We must therefore specify
318 sequences of different lengths, but a parser can always parse
367 various alphabets must not exceed certain maximum code lengths.
369 lengths from symbol frequencies. Again, see Chapter 5,
413 just by giving the bit lengths of the codes for each symbol of
416 by the sequence of bit lengths (2, 1, 3, 3). The following
418 from most- to least-significant bit. The code lengths are
[all …]
/external/mtpd/
Dpptp.c58 static uint8_t lengths[] = { variable
136 uint16_t length = lengths[message]; in set_message()
272 if (incoming.length < lengths[incoming.message]) { in pptp_process()
/external/webkit/Source/WebCore/platform/text/
DTextCodecUTF8.cpp67 static const uint8_t lengths[256] = { in nonASCIISequenceLength() local
85 return lengths[firstByte]; in nonASCIISequenceLength()

1234