| /external/lzma/C/ |
| D | LzFindMt.c | 242 UInt32 *distances = _distances + 1; in GetMatchesSpecN() local
270 *distances++ = maxLen = len; in GetMatchesSpecN()
271 *distances++ = delta - 1; in GetMatchesSpecN()
300 UInt32 num = (UInt32)(distances - _distances); in GetMatchesSpecN()
313 static void BtGetMatches(CMatchFinderMt *p, UInt32 *distances) in BtGetMatches() argument
319 distances[1] = p->hashNumAvail; in BtGetMatches()
326 distances[1] = numProcessed + p->hashNumAvail; in BtGetMatches()
329 distances[0] = curPos + p->hashNumAvail; in BtGetMatches()
330 distances += curPos; in BtGetMatches()
332 *distances++ = 0; in BtGetMatches()
[all …]
|
| D | LzFind.c | 359 UInt32 *distances, UInt32 maxLen) in Hc_GetMatchesSpec() argument
366 return distances; in Hc_GetMatchesSpec()
378 *distances++ = maxLen = len; in Hc_GetMatchesSpec()
379 *distances++ = delta - 1; in Hc_GetMatchesSpec()
381 return distances; in Hc_GetMatchesSpec()
390 UInt32 *distances, UInt32 maxLen) in GetMatchesSpec1() argument
401 return distances; in GetMatchesSpec1()
415 *distances++ = maxLen = len; in GetMatchesSpec1()
416 *distances++ = delta - 1; in GetMatchesSpec1()
421 return distances; in GetMatchesSpec1()
[all …]
|
| D | LzFind.h | 81 UInt32 *distances, UInt32 maxLen);
92 typedef UInt32 (*Mf_GetMatches_Func)(void *object, UInt32 *distances);
109 UInt32 Bt3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
110 UInt32 Hc3Zip_MatchFinder_GetMatches(CMatchFinder *p, UInt32 *distances);
|
| D | LzFindMt.h | 39 typedef UInt32 * (*Mf_Mix_Matches)(void *p, UInt32 matchMinPos, UInt32 *distances);
|
| /external/lzma/Java/SevenZip/Compression/LZ/ |
| D | BinTree.java | 118 public int GetMatches(int[] distances) throws IOException in GetMatches() argument
160 distances[offset++] = maxLen = 2; in GetMatches()
161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches()
168 distances[offset++] = maxLen = 3; in GetMatches()
169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches()
194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches()
195 distances[offset++] = _pos - curMatch - 1; in GetMatches()
223 distances[offset++] = maxLen = len; in GetMatches()
224 distances[offset++] = delta - 1; in GetMatches()
|
| /external/lzma/CS/7zip/Compress/LZ/ |
| D | LzBinTree.cs | 118 public UInt32 GetMatches(UInt32[] distances) in GetMatches() argument
160 distances[offset++] = maxLen = 2; in GetMatches()
161 distances[offset++] = _pos - curMatch2 - 1; in GetMatches()
168 distances[offset++] = maxLen = 3; in GetMatches()
169 distances[offset++] = _pos - curMatch3 - 1; in GetMatches()
194 distances[offset++] = maxLen = kNumHashDirectBytes; in GetMatches()
195 distances[offset++] = _pos - curMatch - 1; in GetMatches()
223 distances[offset++] = maxLen = len; in GetMatches()
224 distances[offset++] = delta - 1; in GetMatches()
|
| D | IMatchFinder.cs | 21 UInt32 GetMatches(UInt32[] distances); in GetMatches() argument
|
| /external/libmojo/mojo/public/js/test/ |
| D | validation_test_input_parser.js | 141 this.distances = {};
213 if (this.distances[item.value])
215 this.distances[item.value] = {index: this.index, item: item}; property
219 var dist = this.distances[item.value];
222 delete this.distances[item.value];
260 for (var name in this.distances) {
261 if (this.distances.hasOwnProperty(name))
|
| /external/skia/src/pathops/ |
| D | SkPathWriter.cpp | 179 DistanceLessThan(double* distances) : fDistances(distances) { } in DistanceLessThan() argument
226 SkSTArray<8, double, true> distances(entries); in assemble() local
239 distances.push_back(dist); // oStart distance from iStart in assemble()
245 SkTQSort<int>(sortedDist.begin(), sortedDist.end() - 1, DistanceLessThan(distances.begin())); in assemble()
|
| /external/tcpdump/ |
| D | print-egp.c | 138 int gateways, distances, networks; in egpnrprint() local
182 distances = *cp++; in egpnrprint()
190 while (--distances >= 0) { in egpnrprint()
|
| /external/brotli/research/ |
| D | README.md | 3 …distances in large-window brotli. In large-window compression the average cost of a backward refer…
|
| /external/mesa3d/src/gallium/docs/source/ |
| D | pipeline.txt | 43 | (consume clip distances) |
|
| D | tgsi.rst | 3142 The limits on both clip and cull distances are bound
3145 distances and by the PIPE_MAX_CLIP_OR_CULL_DISTANCE_ELEMENT_COUNT
3153 Note this covers clipping and culling distances.
3158 For clip distances:
3160 the interpolated plane distances are >= 0.
3162 For cull distances:
3171 The limits on both clip and cull distances are bound
3174 distances and by the PIPE_MAX_CLIP_OR_CULL_DISTANCE_ELEMENT_COUNT
3473 This is useful for APIs that don't have UCPs and where clip distances written
|
| /external/autotest/client/site_tests/firmware_TouchMTB/ |
| D | mtb.py | 847 distances = []
850 distances.append(distance)
851 return distances
985 distances = map(abs, displacements)
990 if self._is_large(distances, i)]
|
| /external/llvm/test/Transforms/LoopVectorize/AArch64/ |
| D | max-vf-for-interleaved.ll | 9 ; distances. In this test, the maximum safe dependence distance for
|
| /external/cros/system_api/dbus/power_manager/ |
| D | policy.proto | 119 // presentation mode. Other delays' distances from |screen_dim_ms| are
128 // Other delays' distances from |screen_dim_ms| are preserved after
|
| /external/mesa3d/src/gallium/docs/source/cso/ |
| D | rasterizer.rst | 342 shader clip distances cannot be mixed, and clip distances take precedence.
|
| /external/syslinux/com32/lib/zlib/ |
| D | algorithm.txt | 14 match distances are compressed with another tree. The trees are stored
28 favor small distances and thus take advantage of the Huffman encoding.
|
| /external/zlib/src/doc/ |
| D | algorithm.txt | 14 match distances are compressed with another tree. The trees are stored
28 favor small distances and thus take advantage of the Huffman encoding.
|
| D | rfc1951.txt | 207 "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.
812 strings, to favor small distances and thus take advantage of the
|
| /external/python/cpython2/Modules/zlib/ |
| D | algorithm.txt | 14 match distances are compressed with another tree. The trees are stored
28 favor small distances and thus take advantage of the Huffman encoding.
|
| /external/blktrace/btt/doc/ |
| D | btt.tex | 234 Another useful measure is the variability in the sector distances
243 The first of the two sections displays values for Q2Q seek distances --
245 are to each other. The second section shows D2D seek distances --
836 seek distances based solely upon the ending block address of one IO,
839 section~\ref{sec:seek} for more details about seek distances.
|
| /external/python/cpython2/Doc/library/ |
| D | tkinter.rst | 650 Screen distances can be specified in either pixels or absolute distances.
651 Pixels are given as numbers and absolute distances as strings, with the trailing
|
| /external/lzma/DOC/ |
| D | lzma-specification.txt | 923 The LZMA decoder keeps the history of latest 4 match distances that were used
924 by decoder. That set of 4 variables contains zero-based match distances and
|
| /external/zlib/src/ |
| D | ChangeLog | 675 - Add INFLATE_STRICT to check distances against zlib header
1000 - Avoid accesses before window for invalid distances with inflate window
|