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

  /src/lib/libform/
type_enum.c 152 bool cur_match; local in function:match_enum
195 cur_match = (strncasecmp(&choices[i][enum_start],
200 cur_match = (strncmp(&choices[i][enum_start],
206 (cur_match == TRUE)? "TRUE" : "FALSE");
208 if (cur_match == TRUE) {
  /src/common/dist/zlib/
deflate.c 1346 * IN assertions: cur_match is the head of the hash chain for the current
1350 local uInt longest_match(deflate_state *s, IPos cur_match) {
1359 /* Stop when cur_match becomes <= limit. To simplify the code,
1396 Assert(cur_match < s->strstart, "no future");
1397 match = s->window + cur_match;
1476 s->match_start = cur_match;
1486 } while ((cur_match = prev[cur_match & wmask]) > limit
1498 local uInt longest_match(deflate_state *s, IPos cur_match) {
1512 Assert(cur_match < s->strstart, "no future")
    [all...]
  /src/sys/net/
zlib.c 695 uInt longest_match(deflate_state *s, IPos cur_match);
697 local uInt longest_match(deflate_state *s, IPos cur_match);
1341 * IN assertions: cur_match is the head of the hash chain for the current
1351 IPos cur_match) /* current match */
1361 /* Stop when cur_match becomes <= limit. To simplify the code,
1397 Assert(cur_match < s->strstart, "no future");
1398 match = s->window + cur_match;
1470 s->match_start = cur_match;
1480 } while ((cur_match = prev[cur_match & wmask]) > limi
    [all...]

Completed in 43 milliseconds