HomeSort by relevance Sort by last modified time
    Searched refs:sublen (Results 1 - 11 of 11) sorted by null

  /external/zopfli/src/zopfli/
cache.h 37 to every possible shorter-than-the-best length (the so called "sublen" array).
42 unsigned char* sublen; member in struct:ZopfliLongestMatchCache
51 /* Stores sublen array in the cache. */
52 void ZopfliSublenToCache(const unsigned short* sublen,
56 /* Extracts sublen array from the cache. */
59 unsigned short* sublen);
cache.c 33 lmc->sublen = (unsigned char*)malloc(ZOPFLI_CACHE_LENGTH * 3 * blocksize);
39 for (i = 0; i < ZOPFLI_CACHE_LENGTH * blocksize * 3; i++) lmc->sublen[i] = 0;
45 free(lmc->sublen);
48 void ZopfliSublenToCache(const unsigned short* sublen,
60 cache = &lmc->sublen[ZOPFLI_CACHE_LENGTH * pos * 3];
63 if (i == length || sublen[i] != sublen[i + 1]) {
65 cache[j * 3 + 1] = sublen[i] % 256;
66 cache[j * 3 + 2] = (sublen[i] >> 8) % 256;
83 unsigned short* sublen) {
    [all...]
lz77.c 157 Gets distance, length and sublen values from the cache if possible.
164 unsigned short* sublen, unsigned short* distance, unsigned short* length) {
175 (sublen && ZopfliMaxCachedSublen(s->lmc,
179 if (!sublen || s->lmc->length[lmcpos]
183 if (sublen) {
184 ZopfliCacheToSublen(s->lmc, lmcpos, *length, sublen);
185 *distance = sublen[*length];
187 assert(sublen[*length] == s->lmc->dist[lmcpos]);
203 Stores the found sublen, distance and length in the longest match cache, if
208 const unsigned short* sublen,
    [all...]
lz77.h 78 Even when not using "sublen", it can be more efficient to provide an array,
86 sublen: output array of 259 elements, or null. Has, for each length, the
94 unsigned short* sublen, unsigned short* distance, unsigned short* length);
squeeze.c 219 unsigned short sublen[259]; local
268 ZopfliFindLongestMatch(s, h, in, i, inend, ZOPFLI_MAX_MATCH, sublen,
288 newCost = costs[j] + costmodel(k, sublen[k], costcontext);
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_bigmem.py 162 sublen = len(SUBSTR)
166 self.assertEqual(s.find(' ', sublen), sublen + size)
167 self.assertEqual(s.find(SUBSTR, len(SUBSTR)), sublen + size)
169 self.assertEqual(s.find('i', sublen),
170 sublen + size + SUBSTR.find('i'))
172 sublen + size + SUBSTR.find('i'))
178 sublen = len(SUBSTR)
182 self.assertEqual(s.index(' ', sublen), sublen + size
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_bigmem.py 162 sublen = len(SUBSTR)
166 self.assertEqual(s.find(' ', sublen), sublen + size)
167 self.assertEqual(s.find(SUBSTR, len(SUBSTR)), sublen + size)
169 self.assertEqual(s.find('i', sublen),
170 sublen + size + SUBSTR.find('i'))
172 sublen + size + SUBSTR.find('i'))
178 sublen = len(SUBSTR)
182 self.assertEqual(s.index(' ', sublen), sublen + size
    [all...]
  /external/tcpdump/
print-babel.c 253 uint8_t subtype, sublen; local
264 sublen = *cp++;
265 if(cp + sublen > ep)
271 cp += sublen;
275 if (sublen == 0) {
280 while(sublen--) {
289 cp += sublen;
print-lldp.c 643 u_int sublen; local
682 sublen = *(tptr+6);
683 if (tlv_len < 7+sublen) {
687 safeputs((const char *)tptr+7, sublen);
693 sublen = *(tptr+4);
694 if (tlv_len < 5+sublen) {
698 safeputs((const char *)tptr+5, sublen);
774 sublen=tlv_len-5;
775 if(sublen%3!=0){
780 while(i<sublen) {
    [all...]
print-isoclns.c 1970 u_int metric, status_byte, bit_length, byte_length, sublen, processed, subtlvtype, subtlvlen; local
    [all...]
  /external/wpa_supplicant_8/src/ap/
ieee802_1x.c 1437 u8 *buf, *pos, *end, type, sublen; local
    [all...]

Completed in 174 milliseconds