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

  /src/usr.bin/what/
what.c 58 static int matches; variable in typeref:typename:int
71 matches = sflag = 0;
97 return matches ? 0 : 1;
119 matches++;
  /src/tests/usr.bin/xlint/lint1/
check-expect.lua 148 local function matches(comment, pattern) function
168 assert_equals(matches("a", "a"), true)
169 assert_equals(matches("a", "b"), false)
170 assert_equals(matches("a", "aaa"), false)
172 assert_equals(matches("abc", "a..."), true)
173 assert_equals(matches("abc", "c..."), false)
175 assert_equals(matches("abc", "...c"), true)
176 assert_equals(matches("abc", "...a"), false)
178 assert_equals(matches("abc123xyz", "...a..."), true)
179 assert_equals(matches("abc123xyz", "...b..."), true
    [all...]
  /src/sys/external/bsd/drm2/include/linux/
dmi.h 68 struct dmi_strmatch matches[4]; member in struct:dmi_system_id
  /src/usr.bin/grep/
util.c 248 /* Count the matches if we have a match limit */
283 * matches. The matching lines are passed to printline() to display the
289 regmatch_t matches[MAX_LINE_MATCHES]; local in function:procline
343 matches[m++] = pmatch;
344 /* matches - skip further patterns */
353 /* One pass if we are not recording matches */
358 break; /* No matches */
373 printline(l, ':', matches, m);
375 printline(l, '-', matches, m);
444 printline(struct str *line, int sep, regmatch_t *matches, int m
    [all...]
  /src/sys/dev/pcmcia/
pcmcia.c 389 int matches; local in function:pcmcia_product_lookup
399 /* see if it matches vendor/product */
400 matches = 0;
405 matches = 1;
414 matches = 1;
418 matches = (*matchfn)(pa, pp, matches);
420 if (matches)
  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/afl/
afl_driver.cpp 231 int matches = fscanf(extra_stats_file, kExtraStatsFormatString, local in function:maybe_initialize_extra_stats
236 CHECK_ERROR(matches == kNumExtraStats, "Extra stats file is corrupt");
  /src/tests/lib/libc/regex/
t_regex_att.c 362 checkmatches(const char *matches, size_t nm, const regmatch_t *pm,
369 size_t len = strlen(matches) + 1, off = 0;
371 ATF_REQUIRE((res = strdup(matches)) != NULL);
383 ATF_CHECK_STREQ_MSG(res, matches, " at line %zu", lineno);
405 char *name, *pattern, *input, *matches, *comment; local in function:att_test
457 ATF_REQUIRE_MSG((matches = strtok(NULL, sep)) != NULL,
458 "Missing matches at line %zu", lineno);
490 if (*matches != '(') {
491 geterror(matches, &comp, &exec);
496 nm = getmatches(matches);
    [all...]
  /src/lib/libedit/
filecomplete.c 472 size_t matches; local in function:completion_matches
474 matches = 0;
476 while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
478 if (matches + 3 >= match_list_len) {
480 while (matches + 3 >= match_list_len)
491 match_list[++matches] = retstr;
501 for (; which <= matches; which++) {
517 match_list[matches + 1] = NULL;
536 * 'matches' is list of strings, 'num' is number of strings in 'matches',
670 char **matches; local in function:fn_complete2
    [all...]
  /src/bin/sh/
histedit.c 916 *p = '\0'; /* so no more matches */
941 * use it instead of its standard function to find matches, which
949 char **matches = NULL; local in function:sh_matches
957 if ((matches = malloc(size * sizeof(matches[0]))) == NULL)
984 if (reallocarr(&matches, size,
985 sizeof(*matches)))
991 matches[i] = strdup(entry->d_name);
998 free(matches);
1002 matches[0] = strdup(matches[1])
    [all...]
  /src/common/dist/zlib/
deflate.h 128 * bytes. With this organization, matches are limited to a distance of
173 /* Length of the best match at previous step. Matches not greater than this
260 uInt matches; /* number of string matches in current block */ member in struct:internal_state
  /src/sys/arch/powerpc/booke/pci/
pq3pci.c 583 uint32_t matches = 0; local in function:pq3pci_msi_intr
630 matches |= this_msi;
631 } else if ((matches & this_msi) == 0) {
  /src/sys/net/
zlib.c 389 * bytes. With this organization, matches are limited to a distance of
434 /* Length of the best match at previous step. Matches not greater than this
519 uInt matches; /* number of string matches in current block */ member in struct:deflate_state
623 * most input files: try all possible matches and select the longest.
627 * string matches are performed only when the previous match ends. So it
628 * is preferable to spend more time in matches to allow very fast string
642 * The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
715 /* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
738 /* 1 */ {4, 4, 8, 4, deflate_fast}, /* maximum speed, no lazy matches */
    [all...]
  /src/sys/dev/pci/
if_iwmreg.h 1141 * Note that "64" matches the number of ack bits in a block-ack packet.
5110 * @IWM_LMAC_SCAN_FLAG_MATCH: Send match found notification on matches
5824 * matches passed in the scan offload request
5832 * @matches: array of match information, one for each match
5843 struct iwm_scan_offload_profile_match matches[IWM_SCAN_MAX_PROFILES]; member in struct:iwm_scan_offload_profiles_query
6305 * @cap: capabilities for all channels which matches the MCC
6328 * @cap: capabilities for all channels which matches the MCC

Completed in 60 milliseconds