| /src/external/gpl3/gdb/dist/gdb/unittests/ |
| ptid-selftests.c | 113 /* Verify matches against minus_one. */
115 static_assert (pid.matches (minus_one), "pid matches minus one");
116 static_assert (lwp.matches (minus_one), "lwp matches minus one");
117 static_assert (tid.matches (minus_one), "tid matches minus one");
118 static_assert (both.matches (minus_one), "both matches minus one");
120 /* Verify matches against pid. *
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/unittests/ |
| ptid-selftests.c | 113 /* Verify matches against minus_one. */
115 static_assert (pid.matches (minus_one), "pid matches minus one");
116 static_assert (lwp.matches (minus_one), "lwp matches minus one");
117 static_assert (tid.matches (minus_one), "tid matches minus one");
118 static_assert (both.matches (minus_one), "both matches minus one");
120 /* Verify matches against pid. *
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-cov/ |
| CoverageFilters.cpp | 20 bool NameCoverageFilter::matches( function in class:NameCoverageFilter
27 bool NameRegexCoverageFilter::matches( function in class:NameRegexCoverageFilter
37 bool NameWhitelistCoverageFilter::matches( function in class:NameWhitelistCoverageFilter
43 bool RegionCoverageFilter::matches( function in class:RegionCoverageFilter
50 bool LineCoverageFilter::matches( function in class:LineCoverageFilter
61 bool CoverageFilters::matches(const coverage::CoverageMapping &CM, function in class:CoverageFilters
64 if (Filter->matches(CM, Function))
78 bool CoverageFiltersMatchAll::matches( function in class:CoverageFiltersMatchAll
82 if (!Filter->matches(CM, Function))
|
| CoverageFilters.h | 28 /// Matches specific functions that pass the requirement of this filter.
34 virtual bool matches(const coverage::CoverageMapping &CM, function in class:llvm::CoverageFilter
45 /// Matches functions that contain a specific string in their name.
52 bool matches(const coverage::CoverageMapping &CM,
56 /// Matches functions whose name matches a certain regular expression.
63 bool matches(const coverage::CoverageMapping &CM,
69 /// Matches functions whose name appears in a SpecialCaseList in the
78 bool matches(const coverage::CoverageMapping &CM,
82 /// Matches numbers that pass a certain threshold
[all...] |
| /src/external/gpl3/gdb/dist/readline/readline/ |
| complete.c | 102 completing a word would normally display the list of possible matches.
104 It takes three arguments: (char **matches, int num_matches, int max_length)
105 where MATCHES is the array of strings that matched, NUM_MATCHES is the
164 /* If non-zero, non-unique completions always show the list of matches. */
167 /* If non-zero, non-unique completions show the list of matches, unless it
200 when displaying completion matches. Matches whose printable portion has
206 matches. If < 0 or > _rl_screenwidth, it is ignored. */
254 matches. The second argument is the length of the filename to be
270 /* Pointer to alternative function to create matches
1214 char **matches; local
1458 char *t, **matches, **temp_matches; local
2002 char **matches; local
2225 int matches; local
2712 static char **matches = (char **)0; local
2843 static char **matches = (char **)0; local
[all...] |
| /src/external/gpl3/gdb.old/dist/readline/readline/ |
| complete.c | 102 completing a word would normally display the list of possible matches.
104 It takes three arguments: (char **matches, int num_matches, int max_length)
105 where MATCHES is the array of strings that matched, NUM_MATCHES is the
164 /* If non-zero, non-unique completions always show the list of matches. */
167 /* If non-zero, non-unique completions show the list of matches, unless it
200 when displaying completion matches. Matches whose printable portion has
206 matches. If < 0 or > _rl_screenwidth, it is ignored. */
254 matches. The second argument is the length of the filename to be
270 /* Pointer to alternative function to create matches
1212 char **matches; local
1456 char *t, **matches, **temp_matches; local
2000 char **matches; local
2207 int matches; local
2688 static char **matches = (char **)0; local
2819 static char **matches = (char **)0; local
[all...] |
| /src/lib/libedit/ |
| filecomplete.c | 472 size_t matches; local
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
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_panel_orientation_quirks.c | 118 .matches = {
124 .matches = {
130 .matches = {
138 .matches = {
149 .matches = {
157 .matches = {
165 .matches = {
173 .matches = {
181 .matches = {
193 .matches =
[all...] |
| /src/crypto/external/bsd/netpgp/dist/src/libpaa/ |
| libpaa.c | 95 regmatch_t matches[10]; local
102 if (regexec(&id_re, response, 10, matches, 0) != 0) {
107 (int)(matches[1].rm_eo - matches[1].rm_so),
108 &response[(int)matches[1].rm_so]);
111 if (regexec(&response_re, raw_challenge, 10, matches, 0) != 0) {
116 (int)(matches[1].rm_eo - matches[1].rm_so),
117 &raw_challenge[(int)matches[1].rm_so]);
119 (int)(matches[2].rm_eo - matches[2].rm_so)
227 regmatch_t matches[10]; local
269 regmatch_t matches[10]; local
[all...] |
| /src/sys/external/bsd/drm2/linux/ |
| linux_dmi.c | 107 for (i = 0; i < __arraycount(dsi->matches); i++) {
108 if (dsi->matches[i].slot == DMI_NONE)
110 if (!dmi_match(dsi->matches[i].slot, dsi->matches[i].substr))
122 for (dsi = sysid; dsi->matches[0].slot != DMI_NONE; dsi++) {
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.cp/ |
| cpcompletion.exp | 22 proc test_class_complete {class expr name matches} {
25 set matches [lsort $matches]
39 foreach got [lsort $seen] have $matches {
101 # fully-qualified name matches the completion word.
112 # matches in the tab-completion case only show the part of the
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.cp/ |
| cpcompletion.exp | 22 proc test_class_complete {class expr name matches} {
25 set matches [lsort $matches]
39 foreach got [lsort $seen] have $matches {
101 # fully-qualified name matches the completion word.
112 # matches in the tab-completion case only show the part of the
|
| /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/usr.bin/what/ |
| what.c | 58 static int matches; variable
71 matches = sflag = 0;
97 return matches ? 0 : 1;
119 matches++;
|
| /src/external/gpl3/gcc/dist/gcc/config/bfin/ |
| print-sysroot-suffix.sh | 33 matches=$2
51 for match in $matches
|
| /src/external/gpl3/gcc/dist/gcc/config/m68k/ |
| print-sysroot-suffix.sh | 33 matches=$2
51 for match in $matches
|
| /src/external/gpl3/gcc.old/dist/gcc/config/bfin/ |
| print-sysroot-suffix.sh | 33 matches=$2
51 for match in $matches
|
| /src/external/gpl3/gcc.old/dist/gcc/config/m68k/ |
| print-sysroot-suffix.sh | 33 matches=$2
51 for match in $matches
|
| /src/external/public-domain/xz/dist/src/liblzma/lz/ |
| lz_encoder_mf.c | 19 /// \brief Find matches starting from the current byte
23 lzma_mf_find(lzma_mf *mf, uint32_t *count_ptr, lzma_match *matches)
28 const uint32_t count = mf->find(mf, matches);
30 // Length of the longest match; assume that no matches were found
36 // Validate the matches.
38 assert(matches[i].len <= mf->nice_len);
39 assert(matches[i].dist < mf->read_pos);
41 mf_ptr(mf) - matches[i].dist - 2,
42 matches[i].len) == 0);
48 len_best = matches[count - 1].len
[all...] |
| lz_encoder.h | 53 /// Match finders store locations of matches using 32-bit integers.
90 /// Find matches. Returns the number of distance-length pairs written
91 /// to the matches array. This is called only via lzma_mf_find().
92 uint32_t (*find)(lzma_mf *mf, lzma_match *matches);
142 /// This is used to extend matches of length nice_len to the
146 /// Match finder will search matches up to this length.
175 // times. Since matches are looked up to
213 // 3. The literals and matches are encoded using e.g. LZMA.
310 lzma_mf *mf, uint32_t *count, lzma_match *matches);
312 extern uint32_t lzma_mf_hc3_find(lzma_mf *dict, lzma_match *matches);
[all...] |
| /src/external/public-domain/xz/dist/src/liblzma/lzma/ |
| lzma_encoder_optimum_fast.c | 30 len_main = mf_find(mf, &matches_count, coder->matches);
47 // Look for repeated matches; scan the previous four match distances
83 *back_res = coder->matches[matches_count - 1].dist + REPS;
91 back_main = coder->matches[matches_count - 1].dist;
94 coder->matches[matches_count - 2].len + 1) {
95 if (!change_pair(coder->matches[
101 len_main = coder->matches[matches_count - 1].len;
102 back_main = coder->matches[matches_count - 1].dist;
128 // Get the matches for the next byte. If we find a better match,
131 &coder->matches_count, coder->matches);
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/TableGen/ |
| StringMatcher.h | 28 /// If a match is found, the code in Matches[i].second is executed; control must
29 /// not exit this code fragment. If nothing matches, execution falls through.
36 const std::vector<StringPair> &Matches;
41 const std::vector<StringPair> &matches, raw_ostream &os)
42 : StrVariableName(strVariableName), Matches(matches), OS(os) {}
47 bool EmitStringMatcherForChar(const std::vector<const StringPair *> &Matches,
|
| /src/external/bsd/pam-u2f/dist/tests/ |
| regenerate_credentials.py | 32 matches = re.match(r"^(.*?),(.*?),es256,(.*)$", credstr, re.M)
35 keyhandle=matches.group(1),
36 pubkey=matches.group(2),
37 attributes=matches.group(3),
87 matches = re.match(r"^.*?:(.*?),(.*?),es256,(.*)", line, re.M)
89 keyhandle=matches.group(1),
90 pubkey=matches.group(2),
91 attributes=matches.group(3),
|
| /src/external/bsd/libarchive/dist/tar/ |
| subst.c | 203 regmatch_t matches[10]; local
241 if (regexec(&rule->re, name, 10, matches, 0))
246 realloc_strncat(result, name, matches[0].rm_so);
252 name + matches[0].rm_so,
253 matches[0].rm_eo - matches[0].rm_so);
284 realloc_strncat(result, name + matches[c - '0'].rm_so, matches[c - '0'].rm_eo - matches[c - '0'].rm_so);
295 if (matches[0].rm_eo > 0)
[all...] |
| /src/usr.bin/make/unit-tests/ |
| varmod-match.mk | 26 # * matches 0 or more characters
27 # ? matches 1 character
28 # \x matches the character 'x'
32 # matches exactly the word 'e', twice.
37 # The pattern character '?' matches exactly 1 character, the pattern character
38 # '*' matches 0 or more characters. The whole pattern matches all words that
44 # A pattern without placeholders only matches itself.
83 # [...] matches 1 character from the listed characters
84 # [^...] matches 1 character from the unlisted character
[all...] |
