HomeSort by: relevance | last modified time | path
    Searched refs:prev_length (Results 1 - 5 of 5) sorted by relevancy

  /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/dce/
amdgpu_dce_aux.c 442 uint32_t prev_length = 0; local
480 REG_GET_2(AUX_DPHY_RX_CONTROL1, AUX_RX_TIMEOUT_LEN, &prev_length, AUX_RX_TIMEOUT_LEN_MUL, &prev_mult);
484 prev_timeout_val = prev_length * TIME_OUT_MULTIPLIER_8;
487 prev_timeout_val = prev_length * TIME_OUT_MULTIPLIER_16;
490 prev_timeout_val = prev_length * TIME_OUT_MULTIPLIER_32;
493 prev_timeout_val = prev_length * TIME_OUT_MULTIPLIER_64;
  /src/common/dist/zlib/contrib/gcc_gvmat64/
gvmat64.S 135 printf("#define dsPrevLen %u\n",(int)(((char*)&(s->prev_length))-((char*)s)));
163 #define prev_length [ rcx + dsPrevLen] define
214 //;;; if (s->prev_length >= s->good_match) {
219 mov edi, prev_length
274 mov r11d, prev_length
278 //;;; int best_len = s->prev_length;
  /src/common/dist/zlib/
deflate.c 609 s->match_length = s->prev_length = MIN_MATCH-1;
691 s->match_length = s->prev_length = MIN_MATCH-1;
1343 * return its length. Matches shorter or equal to prev_length are discarded,
1344 * in which case the result is equal to prev_length and match_start is
1347 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1355 int best_len = (int)s->prev_length; /* best match length so far */
1384 if (s->prev_length >= s->good_match) {
1839 /* Find the longest match, discarding those <= prev_length.
1939 /* Find the longest match, discarding those <= prev_length.
1941 s->prev_length = s->match_length, s->prev_match = s->match_start
    [all...]
deflate.h 172 uInt prev_length; member in struct:internal_state
  /src/sys/net/
zlib.c 433 uInt prev_length; member in struct:deflate_state
1328 s->match_length = s->prev_length = MIN_MATCH-1;
1338 * return its length. Matches shorter or equal to prev_length are discarded,
1339 * in which case the result is equal to prev_length and match_start is
1342 * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
1357 int best_len = s->prev_length; /* best match length so far */
1386 if (s->prev_length >= s->good_match) {
1785 /* Find the longest match, discarding those <= prev_length.
1880 /* Find the longest match, discarding those <= prev_length.
1882 s->prev_length = s->match_length, s->prev_match = s->match_start
    [all...]

Completed in 21 milliseconds