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

  /src/lib/libform/
type_enum.c 152 bool cur_match; local
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/external/bsd/pkg_install/dist/lib/
pkg_io.c 235 char *cur_match, *url_pattern, *best_match = NULL; local
271 cur_match = fetchUnquoteFilename(ue.urls + i);
273 if (cur_match == NULL) {
278 if (strip_suffix(cur_match) == 0) {
279 free(cur_match);
282 if (pkg_order(pattern, cur_match, best_match) == 1) {
287 best_match = cur_match;
288 cur_match = NULL;
294 free(cur_match);
  /src/external/public-domain/xz/dist/src/liblzma/lz/
lz_encoder_mf.c 223 matches_count = func(len_limit, pos, cur, cur_match, mf->depth, \
242 /// \param cur_match Start position of the current match candidate
254 uint32_t cur_match,
262 son[cyclic_pos] = cur_match;
265 const uint32_t delta = pos - cur_match;
270 cur_match = son[cyclic_pos - delta
296 mf->son[mf->cyclic_pos] = cur_match; \
312 const uint32_t cur_match = mf->hash[FIX_3_HASH_SIZE + hash_value]; local
351 const uint32_t cur_match local
375 const uint32_t cur_match = mf->hash[FIX_4_HASH_SIZE + hash_value] local
430 const uint32_t cur_match local
593 const uint32_t cur_match = mf->hash[hash_value]; local
608 const uint32_t cur_match = mf->hash[hash_value]; local
627 const uint32_t cur_match = mf->hash[FIX_3_HASH_SIZE + hash_value]; local
660 const uint32_t cur_match local
684 const uint32_t cur_match = mf->hash[FIX_4_HASH_SIZE + hash_value]; local
733 const uint32_t cur_match local
    [all...]
  /src/external/gpl3/binutils/dist/zlib/contrib/masmx86/
match686.asm 37 ;uInt longest_match(s, cur_match)
39 ; IPos cur_match; /* current match */
42 cur_match equ dword ptr[esp+NbStack-0] define
209 ;;; Retrieve the function arguments. ecx will hold cur_match
305 ;;; match = s->window + cur_match;
309 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
410 ;;; s->match_start = cur_match;
  /src/external/gpl3/binutils.old/dist/zlib/contrib/masmx86/
match686.asm 37 ;uInt longest_match(s, cur_match)
39 ; IPos cur_match; /* current match */
42 cur_match equ dword ptr[esp+NbStack-0] define
209 ;;; Retrieve the function arguments. ecx will hold cur_match
305 ;;; match = s->window + cur_match;
309 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
410 ;;; s->match_start = cur_match;
  /src/external/gpl3/gdb/dist/zlib/contrib/masmx86/
match686.asm 37 ;uInt longest_match(s, cur_match)
39 ; IPos cur_match; /* current match */
42 cur_match equ dword ptr[esp+NbStack-0] define
209 ;;; Retrieve the function arguments. ecx will hold cur_match
305 ;;; match = s->window + cur_match;
309 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
410 ;;; s->match_start = cur_match;
  /src/external/gpl3/gdb.old/dist/zlib/contrib/masmx86/
match686.asm 37 ;uInt longest_match(s, cur_match)
39 ; IPos cur_match; /* current match */
42 cur_match equ dword ptr[esp+NbStack-0] define
209 ;;; Retrieve the function arguments. ecx will hold cur_match
305 ;;; match = s->window + cur_match;
309 ;;; } while ((cur_match = prev[cur_match & wmask]) > limit
410 ;;; s->match_start = cur_match;

Completed in 67 milliseconds