/external/zopfli/src/zopfli/ |
H A D | lz77.c | 56 Appends the length and distance to the LZ77 arrays of the ZopfliLZ77Store. 67 Gets a score of the length given the distance. Typically, the score of the 68 length is the length itself, but if the distance is very long, decrease the 77 -avoid using a length of 3 in combination with a long distance. This only has 87 static int GetLengthScore(int length, int distance) { argument 89 At 1024, the distance uses 9+ extra bits and this seems to be the sweet spot 92 return distance > 1024 ? length - 1 : length; 157 Gets distance, length and sublen values from the cache if possible. 164 unsigned short* sublen, unsigned short* distance, unsigned short* length) { 185 *distance 162 TryGetFromLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t* limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument 206 StoreInLongestMatchCache(ZopfliBlockState* s, size_t pos, size_t limit, const unsigned short* sublen, unsigned short distance, unsigned short length) argument 229 ZopfliFindLongestMatch(ZopfliBlockState* s, const ZopfliHash* h, const unsigned char* array, size_t pos, size_t size, size_t limit, unsigned short* sublen, unsigned short* distance, unsigned short* length) argument [all...] |
H A D | lz77.h | 47 if > 0: length in corresponding litlens, this is the distance. */ 66 /* Cache for length/distance pairs found so far. */ 76 Finds the longest match (length and corresponding distance) for LZ77 87 smallest distance required to reach this length. Only 256 of its 259 values 94 unsigned short* sublen, unsigned short* distance, unsigned short* length); 103 Counts the number of literal, length and distance symbols in the given lz77
|
/external/zopfli/src/zopflipng/lodepng/ |
H A D | lodepng.cpp | 451 /*the distance codes have their own symbols, 30 used, 2 unused*/ 466 /*the base backwards distances (the bits of distance codes appear after length codes and use their own huffman tree)*/ 881 /*get the distance code tree of a deflated block with fixed tree, as specified in the deflate specification*/ 888 /*there are 32 distance codes, but 30-31 are unused*/ 957 /*number of distance codes. Unlike the spec, the value 1 is added to it here already*/ 1091 HuffmanTree tree_d; /*the huffman tree for distance codes*/ 1116 unsigned code_d, distance; local 1117 unsigned numextrabits_l, numextrabits_d; /*extra bits for length and distance*/ 1128 /*part 3: get distance code*/ 1138 else error = 18; /*error: invalid distance cod 1314 addLengthDistance(uivector* values, size_t length, size_t distance) argument [all...] |
/external/zxing/core/ |
H A D | core.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/oned/ ... |
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | wnm_sta.c | 374 rep->distance = WPA_GET_LE32(pos + 2);
|
H A D | wnm_sta.h | 37 u32 distance; /* valid if bearing_present=1 */ member in struct:neighbor_report
|
/external/zlib/src/contrib/masmx86/ |
H A D | inffas32.asm | 90 db 'invalid distance code'
95 db 'invalid distance too far back'
|
/external/zlib/src/ |
H A D | deflate.h | 40 /* number of distance codes */ 119 * bytes. With this organization, matches are limited to a distance of 196 struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ 200 struct tree_desc_s d_desc; /* desc. for distance tree */ 307 /* Mapping from a distance to a distance code. dist is the distance - 1 and 330 # define _tr_tally_dist(s, distance, length, flush) \ 332 ush dist = (distance); \ 342 # define _tr_tally_dist(s, distance, lengt [all...] |
/external/vixl/src/vixl/a64/ |
H A D | macro-assembler-a64.cc | 74 ptrdiff_t distance = masm_->CursorOffset() + amount - first_use_; 75 if (distance >= kRecommendedLiteralPoolRange) {
|
/external/vogar/lib/ |
H A D | caliper.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/caliper/ com/google/caliper/util/ ... |
/external/webp/src/dsp/ |
H A D | lossless.h | 177 // Splitting of distance and length codes into prefixes and 180 static WEBP_INLINE void VP8LPrefixEncodeBitsNoLUT(int distance, int* const code, argument 182 const int highest_bit = BitsLog2Floor(--distance); 183 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 188 static WEBP_INLINE void VP8LPrefixEncodeNoLUT(int distance, int* const code, argument 191 const int highest_bit = BitsLog2Floor(--distance); 192 const int second_highest_bit = (distance >> (highest_bit - 1)) & 1; 194 *extra_bits_value = distance & ((1 << *extra_bits) - 1); 207 static WEBP_INLINE void VP8LPrefixEncodeBits(int distance, int* const code, argument 209 if (distance < PREFIX_LOOKUP_IDX_MA 218 VP8LPrefixEncode(int distance, int* const code, int* const extra_bits, int* const extra_bits_value) argument [all...] |
/external/webp/src/enc/ |
H A D | backward_references.c | 267 uint32_t distance; local 285 distance = (uint32_t)(base_position - pos); 288 if (distance < 9 * xsize) { 289 const uint32_t y = distance / xsize; 290 uint32_t x = distance % xsize; 302 best_distance = distance; 306 if ((best_distance == 1 || distance == xsize) && 554 uint32_t distance) { 556 VP8LPrefixEncodeBits(distance, &code, &extra_bits); 553 GetDistanceCost(const CostModel* const m, uint32_t distance) argument
|
H A D | backward_references.h | 50 static WEBP_INLINE PixOrCopy PixOrCopyCreateCopy(uint32_t distance, argument 54 retval.argb_or_distance = distance;
|
H A D | vp8l.c | 459 int code, distance; local 465 distance = PixOrCopyDistance(v); 466 VP8LPrefixEncode(distance, &code, &n_bits, &bits);
|
/external/v8/tools/sodium/ |
H A D | sodium.js | 303 var distance = 0x7FFFFFFF; 313 if ((dist < distance) || (dist == distance && pos > position)) { 315 distance = dist;
|
/external/v8/test/mjsunit/ |
H A D | debug-backtrace-text.js | 48 function distance(p, q) { function 56 a=[1,2,distance]; 79 // 0: Call distance on Point where distance is a property on the prototype 80 // 1: Call distance on Point where distance is a direct property 85 assertEquals("#<Array>[2](aka distance)(p=#<Point>, q=#<Point>)", exec_state.frame(2).invocationText());
|
/external/v8/benchmarks/ |
H A D | raytrace.js | 162 distance : function(color) { 438 info.distance = (-B) - Math.sqrt(D); 443 info.distance 497 info.distance = t; 529 distance: null, 683 best.distance = 2000; 690 if(info.isHit && info.distance >= 0 && info.distance < best.distance){ 749 if (refl.isHit && refl.distance > [all...] |
/external/v8/src/arm/ |
H A D | full-codegen-arm.cc | 391 int distance = masm_->SizeOfCodeGeneratedSince(back_edge_target); local 393 Max(1, distance / kCodeSizeMultiplier)); 431 int distance = masm_->pc_offset(); local 433 Max(1, distance / kCodeSizeMultiplier));
|
/external/v8/src/arm64/ |
H A D | full-codegen-arm64.cc | 370 // We want to do a round rather than a floor of distance/kCodeSizeMultiplier 372 // we add kCodeSizeMultiplier/2 to the distance (equivalent to adding 0.5 to 374 int distance = local 377 Max(1, distance / kCodeSizeMultiplier)); 418 int distance = masm_->pc_offset() + kCodeSizeMultiplier / 2; local 420 Max(1, distance / kCodeSizeMultiplier));
|
/external/v8/src/ |
H A D | assembler.h | 264 void link_to(int pos, Distance distance = kFar) { 265 if (distance == kNear) {
|
H A D | debug.cc | 190 int distance = kMaxInt; local 193 if (this->pc() <= pc && pc - this->pc() < distance) { 195 distance = static_cast<int>(pc - this->pc()); 197 if (distance == 0) break; 214 int distance = kMaxInt; local 230 if (position <= next_position && next_position - position < distance) { 232 distance = next_position - position; 234 if (distance == 0) break;
|
/external/v8/src/ia32/ |
H A D | assembler-ia32.cc | 1410 void Assembler::jmp(Label* L, Label::Distance distance) { argument 1426 } else if (distance == Label::kNear) { 1464 void Assembler::j(Condition cc, Label* L, Label::Distance distance) { argument 1482 } else if (distance == Label::kNear) {
|
H A D | assembler-ia32.h | 828 void jmp(Label* L, Label::Distance distance = Label::kFar); 837 Label::Distance distance = Label::kFar);
|
H A D | full-codegen-ia32.cc | 40 Label::Distance distance = Label::kFar) { 42 EmitJump(not_carry, target, distance); // Always taken before patched. 47 Label::Distance distance = Label::kFar) { 49 EmitJump(carry, target, distance); // Never taken before patched. 67 void EmitJump(Condition cc, Label* target, Label::Distance distance) { argument 71 __ j(cc, target, distance); 351 int distance = masm_->SizeOfCodeGeneratedSince(back_edge_target); local 353 Max(1, distance / kCodeSizeMultiplier)); 390 int distance = masm_->pc_offset(); local 392 Max(1, distance / kCodeSizeMultiplie [all...] |
H A D | macro-assembler-ia32.cc | 634 Label::Distance distance) { 641 j(above, fail, distance); 647 Label::Distance distance) { 654 j(below_equal, fail, distance); 657 j(above, fail, distance); 663 Label::Distance distance) { 668 j(above, fail, distance); 2921 Label::Distance distance) { 2927 j(not_equal, not_unique_name, distance); 3185 Label::Distance distance) { 632 CheckFastElements(Register map, Label* fail, Label::Distance distance) argument 645 CheckFastObjectElements(Register map, Label* fail, Label::Distance distance) argument 661 CheckFastSmiElements(Register map, Label* fail, Label::Distance distance) argument 2919 JumpIfNotUniqueNameInstanceType(Operand operand, Label* not_unique_name, Label::Distance distance) argument 3180 EnsureNotWhite( Register value, Register bitmap_scratch, Register mask_scratch, Label* value_is_white_and_not_data, Label::Distance distance) argument [all...] |