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

  /external/ppp/pppd/plugins/pppoatm/
misc.c 23 int ref_len,best_len,len; local
29 best_len = 0;
33 if (*value != '!' && len <= ref_len && len > best_len &&
36 best_len = len;
40 if (best > -1) (*pos) += best_len;
  /packages/apps/Gallery2/jni/filters/
kmeans.h 125 N best_len = euclideanDist <T, N>(values, oldCenters, dimension); local
129 if (l < best_len) {
130 best_len = l;
  /external/chromium_org/third_party/yasm/source/patched-yasm/libyasm/tests/
opt-gvmat64.asm 259 ;;; int best_len = s->prev_length;
262 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
267 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
326 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
453 ;;; best_len = len;
455 ;;; scan_end = *(ushf*)(scan+best_len-1);
475 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
  /external/chromium_org/third_party/zlib/
deflate.c 1147 int best_len = s->prev_length; \/* best match length so far *\/ local
    [all...]
  /external/qemu/distrib/zlib-1.2.3/
deflate.c 1035 int best_len = s->prev_length; \/* best match length so far *\/ local
    [all...]
  /external/zlib/src/
deflate.c 1156 int best_len = s->prev_length; \/* best match length so far *\/ local
    [all...]
  /external/zlib/src/contrib/masmx86/
match686.asm 53 best_len equ dword ptr [esp+NbStack-36] define
277 ;;; int best_len = s->prev_length;
282 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
288 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
306 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
411 ;;; best_len = len;
413 ;;; scan_end = *(ushf*)(scan+best_len-1);
435 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
  /external/zlib/src/contrib/masmx64/
gvmat64.asm 297 ;;; int best_len = s->prev_length;
300 ;;; Store the sum of s->window + best_len in esi locally, and in esi.
305 ;;; register ush scan_end = *(ushf*)(scan+best_len-1);
364 ;;; if (*(ushf*)(match+best_len-1) != scan_end ||
493 ;;; best_len = len;
495 ;;; scan_end = *(ushf*)(scan+best_len-1);
516 ;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;

Completed in 962 milliseconds