| /external/lzma/CS/7zip/Common/ |
| D | CommandLineParser.cs | 27 int minLen, int maxLen, string postCharSet) in SwitchForm() argument
32 MinLen = minLen; in SwitchForm()
36 public SwitchForm(string idString, SwitchType type, bool multi, int minLen): in SwitchForm() argument
37 this(idString, type, multi, minLen, 0, "") in SwitchForm()
145 int minLen = switchForm.MinLen; in ParseString()
146 if (tailSize < minLen) in ParseString()
153 String stringSwitch = srcString.Substring(pos, minLen); in ParseString()
154 pos += minLen; in ParseString()
155 for (int i = minLen; i < switchForm.MaxLen && pos < len; i++, pos++) in ParseString()
|
| /external/bzip2/ |
| D | huffman.c | 154 Int32 minLen, in BZ2_hbAssignCodes() argument
161 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
174 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
181 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
193 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
198 for (i = minLen + 1; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
|
| D | compress.c | 242 Int32 nSelectors, alphaSize, minLen, maxLen, selCtr; in sendMTFValues() local
482 minLen = 32; in sendMTFValues()
486 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in sendMTFValues()
489 AssertH ( !(minLen < 1), 3005 ); in sendMTFValues()
491 minLen, maxLen, alphaSize ); in sendMTFValues()
|
| D | decompress.c | 110 Int32 minLen, maxLen; in BZ2_decompress() local
333 minLen = 32; in BZ2_decompress()
337 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
344 minLen, maxLen, alphaSize in BZ2_decompress()
346 s->minLens[t] = minLen; in BZ2_decompress()
|
| /external/lzma/CPP/Common/ |
| D | CommandLineParser.cpp | 169 int minLen = switchForm.MinLen; in ParseString() local
170 if (tailSize < minLen) in ParseString()
178 UString stringSwitch = s.Mid(pos, minLen); in ParseString()
179 pos += minLen; in ParseString()
180 for (int i = minLen; i < maxLen && pos < len; i++, pos++) in ParseString()
|
| /external/chromium_org/third_party/icu/source/test/perf/usetperf/ |
| D | bitset.cpp | 50 void BitSet::ensureCapacity(uint32_t minLen) { in ensureCapacity() argument
52 while (newLen < minLen) newLen <<= 1; // grow exponentially in ensureCapacity()
|
| D | bitset.h | 21 void ensureCapacity(uint32_t minLen);
|
| /external/icu/icu4c/source/test/perf/usetperf/ |
| D | bitset.cpp | 50 void BitSet::ensureCapacity(uint32_t minLen) { in ensureCapacity() argument
52 while (newLen < minLen) newLen <<= 1; // grow exponentially in ensureCapacity()
|
| D | bitset.h | 21 void ensureCapacity(uint32_t minLen);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | IntArray.java | 295 int minLen = otherUsedLen + words + 1; in addShiftedByBits() local
296 if (minLen > m_ints.length) in addShiftedByBits()
298 m_ints = resizedInts(minLen); in addShiftedByBits()
343 int minLen = otherUsedLen + words; in addShiftedByWords() local
344 if (minLen > m_ints.length) in addShiftedByWords()
346 m_ints = resizedInts(minLen); in addShiftedByWords()
|
| D | LongArray.java | 690 int minLen = otherUsedLen + words; in addShiftedByWords() local
691 if (minLen > m_ints.length) in addShiftedByWords()
693 m_ints = resizedInts(minLen); in addShiftedByWords()
|
| /external/chromium_org/third_party/ots/third_party/lzma_sdk/ |
| D | LzFind.c | 468 #define GET_MATCHES_HEADER2(minLen, ret_op) \ argument
470 lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
473 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0) argument
474 #define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue) argument
|
| /external/lzma/C/ |
| D | LzFind.c | 467 #define GET_MATCHES_HEADER2(minLen, ret_op) \ argument
469 lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
472 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0) argument
473 #define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue) argument
|
| /external/chromium_org/third_party/lzma_sdk/ |
| D | LzFind.c | 467 #define GET_MATCHES_HEADER2(minLen, ret_op) \ argument
469 lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
472 #define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0) argument
473 #define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue) argument
|
| /external/valgrind/main/VEX/switchback/ |
| D | test_bzip2.c | 1460 Int32 minLen, maxLen; in BZ2_decompress() local
1683 minLen = 32; in BZ2_decompress()
1687 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1694 minLen, maxLen, alphaSize in BZ2_decompress()
1696 s->minLens[t] = minLen; in BZ2_decompress()
3309 Int32 minLen, in BZ2_hbAssignCodes() argument
3316 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3329 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3336 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3348 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| /external/valgrind/main/exp-sgcheck/tests/ |
| D | hackedbz2.c | 1484 Int32 minLen, maxLen; in BZ2_decompress() local
1707 minLen = 32; in BZ2_decompress()
1711 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1718 minLen, maxLen, alphaSize in BZ2_decompress()
1720 s->minLens[t] = minLen; in BZ2_decompress()
3333 Int32 minLen, in BZ2_hbAssignCodes() argument
3340 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3353 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3360 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3372 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| /external/valgrind/main/memcheck/tests/ |
| D | origin5-bz2.c | 1475 Int32 minLen, maxLen; in BZ2_decompress() local
1698 minLen = 32; in BZ2_decompress()
1702 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1709 minLen, maxLen, alphaSize in BZ2_decompress()
1711 s->minLens[t] = minLen; in BZ2_decompress()
3324 Int32 minLen, in BZ2_hbAssignCodes() argument
3331 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3344 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3351 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3363 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| D | varinfo6.c | 1513 Int32 minLen, maxLen; in BZ2_decompress() local
1737 minLen = 32; in BZ2_decompress()
1741 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1748 minLen, maxLen, alphaSize in BZ2_decompress()
1750 s->minLens[t] = minLen; in BZ2_decompress()
3362 Int32 minLen, in BZ2_hbAssignCodes() argument
3369 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3382 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3389 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3401 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| /external/valgrind/main/perf/ |
| D | bz2.c | 1475 Int32 minLen, maxLen; in BZ2_decompress() local
1698 minLen = 32; in BZ2_decompress()
1702 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1709 minLen, maxLen, alphaSize in BZ2_decompress()
1711 s->minLens[t] = minLen; in BZ2_decompress()
3324 Int32 minLen, in BZ2_hbAssignCodes() argument
3331 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
3344 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
3351 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
3363 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| D | test_input_for_tinycc.c | 1432 Int32 minLen, maxLen; in BZ2_decompress() local
1655 minLen = 32; in BZ2_decompress()
1659 if (s->len[t][i] < minLen) minLen = s->len[t][i]; in BZ2_decompress()
1666 minLen, maxLen, alphaSize in BZ2_decompress()
1668 s->minLens[t] = minLen; in BZ2_decompress()
2817 Int32 minLen, in BZ2_hbAssignCodes() argument
2824 for (n = minLen; n <= maxLen; n++) { in BZ2_hbAssignCodes()
2837 Int32 minLen, in BZ2_hbCreateDecodeTables() argument
2844 for (i = minLen; i <= maxLen; i++) in BZ2_hbCreateDecodeTables()
2856 for (i = minLen; i <= maxLen; i++) { in BZ2_hbCreateDecodeTables()
[all …]
|
| /external/icu/icu4c/source/i18n/ |
| D | dtptngen_impl.h | 108 int16_t minLen; member
|
| D | dtptngen.cpp | 1641 int32_t repeatCount = row->minLen; // #7930 removes cap at 3 in set()
1836 if (dtTypes[i+1].minLen <= len) { in getCanonicalIndex()
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| D | dtptngen_impl.h | 108 int16_t minLen; member
|
| D | dtptngen.cpp | 1640 int32_t repeatCount = row->minLen; // #7930 removes cap at 3 in set()
1835 if (dtTypes[i+1].minLen <= len) { in getCanonicalIndex()
|
| /external/chromium_org/third_party/brotli/src/ |
| D | ots-lzma.patch | 2600 +#define GET_MATCHES_HEADER2(minLen, ret_op) \
2602 + lenLimit = p->lenLimit; { if (lenLimit < minLen) { MatchFinder_MovePos(p); ret_op; }} \
2605 +#define GET_MATCHES_HEADER(minLen) GET_MATCHES_HEADER2(minLen, return 0)
2606 +#define SKIP_HEADER(minLen) GET_MATCHES_HEADER2(minLen, continue)
|