Searched refs:matches (Results 1 - 25 of 242) sorted by relevance

12345678910

/freebsd-current/contrib/kyua/utils/text/
H A Dregex_test.cpp41 const text::regex_matches matches = text::match_regex( local
43 ATF_REQUIRE(!matches);
44 ATF_REQUIRE_EQ(0, matches.count());
51 const text::regex_matches matches = text::match_regex( local
53 ATF_REQUIRE(matches);
54 ATF_REQUIRE_EQ(1, matches.count());
55 ATF_REQUIRE_EQ("foo and bar", matches.get(0));
62 const text::regex_matches matches = text::match_regex( local
64 ATF_REQUIRE(matches);
65 ATF_REQUIRE_EQ(2, matches
74 const text::regex_matches matches = text::match_regex( local
87 const text::regex_matches matches = text::match_regex( local
99 const text::regex_matches matches = text::match_regex( local
115 const text::regex_matches matches = regex.match("my number is 581."); local
123 const text::regex_matches matches = regex.match("your number is 6"); local
[all...]
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-cov/
H A DCoverageFilters.cpp20 bool NameCoverageFilter::matches( function in class:NameCoverageFilter
27 bool NameRegexCoverageFilter::matches( function in class:NameRegexCoverageFilter
37 bool NameAllowlistCoverageFilter::matches( function in class:NameAllowlistCoverageFilter
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))
H A DCoverageFilters.h34 virtual bool matches(const coverage::CoverageMapping &CM, function in class:llvm::CoverageFilter
52 bool matches(const coverage::CoverageMapping &CM,
56 /// Matches functions whose name matches a certain regular expression.
63 bool matches(const coverage::CoverageMapping &CM,
78 bool matches(const coverage::CoverageMapping &CM,
115 bool matches(const coverage::CoverageMapping &CM,
127 bool matches(const coverage::CoverageMapping &CM,
144 bool matches(const coverage::CoverageMapping &CM,
155 bool matches(const coverage::CoverageMapping &CM,
/freebsd-current/contrib/libedit/
H A Dfilecomplete.c472 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',
543 fn_display_match_list(EditLine * el, char **matches, size_t num, size_t width, const char *(*app_func) (const char *)) argument
670 char **matches; local
[all...]
/freebsd-current/sys/compat/linuxkpi/common/src/
H A Dlinux_dmi.c74 /* Match a system against the struct, all matches must be ok */
81 for (i = 0; i < nitems(dsi->matches); i++) {
82 slot = dsi->matches[i].slot;
88 if (dsi->matches[i].exact_match) {
89 if (dmi_match(slot, dsi->matches[i].substr))
92 dsi->matches[i].substr) != NULL) {
119 for (dsi = list; dsi->matches[0].slot != 0; dsi++) {
130 * Return the number of matches.
136 int matches = 0; local
138 for (dsi = sysid; dsi->matches[
[all...]
/freebsd-current/contrib/llvm-project/lldb/bindings/interface/
H A DSBValueListExtensions.i50 matches = []
54 matches.append(value)
55 return matches
60 matches = []
65 matches.append(value)
66 return matches
H A DSBModuleExtensions.i77 matches = []
82 matches.append(symbol)
83 return matches
85 matches = []
93 matches.append(symbol)
100 matches.append(symbol)
101 return matches
144 matches = []
151 matches.append(section)
152 return matches
[all...]
/freebsd-current/sys/isa/
H A Disahint.c106 int line, matches, unit; local
128 matches = 0;
146 matches++;
153 matches++;
157 if (matches > 0)
161 matches++;
167 matches++;
173 if (matches > 0) {
/freebsd-current/sys/dev/pci/
H A Dpci_user.c99 u_int32_t num_matches; /* number of matches returned */
100 u_int32_t matches; /* struct pci_conf ptr */ member in struct:pci_conf_io32
148 * structures. The first argument, 'matches', is an array of num_matches
150 * structure that will be compared to every entry in the matches array.
154 pci_conf_match_native(struct pci_match_conf *matches, int num_matches, argument
159 if ((matches == NULL) || (match_buf == NULL) || (num_matches <= 0))
166 if (matches[i].flags == PCI_GETCONF_NO_MATCH)
174 if (((matches[i].flags & PCI_GETCONF_MATCH_DOMAIN) != 0)
176 matches[i].pc_sel.pc_domain))
179 if (((matches[
220 pci_conf_match32(struct pci_match_conf32 *matches, int num_matches, struct pci_conf *match_buf) argument
377 pci_conf_match_old(struct pci_match_conf_old *matches, int num_matches, struct pci_conf *match_buf) argument
441 pci_conf_match_old32(struct pci_match_conf_old32 *matches, int num_matches, struct pci_conf *match_buf) argument
519 pci_conf_match(u_long cmd, struct pci_match_conf *matches, int num_matches, struct pci_conf *match_buf) argument
[all...]
/freebsd-current/contrib/xz/src/liblzma/lz/
H A Dlz_encoder_mf.c19 /// \brief Find matches starting from the current byte
23 lzma_mf_find(lzma_mf *mf, uint32_t *count_ptr, lzma_match *matches) argument
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[coun
251 hc_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument
306 lzma_mf_hc3_find(lzma_mf *mf, lzma_match *matches) argument
367 lzma_mf_hc4_find(lzma_mf *mf, lzma_match *matches) argument
451 bt_find_func( const uint32_t len_limit, const uint32_t pos, const uint8_t *const cur, uint32_t cur_match, uint32_t depth, uint32_t *const son, const uint32_t cyclic_pos, const uint32_t cyclic_size, lzma_match *matches, uint32_t len_best) argument
588 lzma_mf_bt2_find(lzma_mf *mf, lzma_match *matches) argument
621 lzma_mf_bt3_find(lzma_mf *mf, lzma_match *matches) argument
676 lzma_mf_bt4_find(lzma_mf *mf, lzma_match *matches) argument
[all...]
H A Dlz_encoder.h61 /// Match finders store locations of matches using 32-bit integers.
98 /// Find matches. Returns the number of distance-length pairs written
99 /// to the matches array. This is called only via lzma_mf_find().
100 uint32_t (*find)(lzma_mf *mf, lzma_match *matches);
150 /// This is used to extend matches of length nice_len to the
154 /// Match finder will search matches up to this length.
183 // times. Since matches are looked up to
225 // 3. The literals and matches are encoded using e.g. LZMA.
332 lzma_mf *mf, uint32_t *count, lzma_match *matches);
334 extern uint32_t lzma_mf_hc3_find(lzma_mf *dict, lzma_match *matches);
[all...]
/freebsd-current/contrib/xz/src/liblzma/lzma/
H A Dlzma_encoder_optimum_fast.c30 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...]
/freebsd-current/bin/sh/
H A Dhistedit.c473 *p = '\0'; /* so no more matches */
592 **add_match(char **matches, size_t i, size_t *size, char *match_copy) argument
596 matches[i] = match_copy;
599 matches = reallocarray(matches, *size, sizeof(matches[0]));
602 return (matches);
616 char **matches = NULL, **rmatches; local
627 if ((matches = malloc(size * sizeof(matches[
[all...]
/freebsd-current/contrib/llvm-project/lldb/source/Utility/
H A DRegularExpression.cpp25 llvm::SmallVectorImpl<llvm::StringRef> *matches) const {
28 return m_regex.match(str, matches);
H A DStringLexer.cpp44 bool matches = true; local
47 matches = false;
51 if (!matches) {
H A DCompletionRequest.cpp71 void CompletionResult::GetMatches(StringList &matches) const {
72 matches.Clear();
74 matches.AppendString(completion.GetCompletion());
/freebsd-current/contrib/llvm-project/llvm/include/llvm/TableGen/
H A DStringMatcher.h29 /// not exit this code fragment. If nothing matches, execution falls through.
41 const std::vector<StringPair> &matches, raw_ostream &os)
42 : StrVariableName(strVariableName), Matches(matches), OS(os) {}
40 StringMatcher(StringRef strVariableName, const std::vector<StringPair> &matches, raw_ostream &os) argument
/freebsd-current/crypto/openssl/Configurations/
H A Dunix-checker.pm14 directory separators). Please use an implementation that matches your
H A Dwindows-checker.pm14 slash directory separators). Please use an implementation that matches your
/freebsd-current/contrib/cortex-strings/scripts/
H A Dplot-top.py30 matches = [x for x in records if x.variant==variant and x.function==function and x.src_alignment==8]
32 if matches:
34 match in matches]
/freebsd-current/contrib/llvm-project/lldb/source/Commands/
H A DCommandObjectHelp.cpp101 StringList matches; local
103 cmd_obj = m_interpreter.GetCommandObject(command_name, &matches);
106 StringList matches; local
114 matches.Clear();
124 sub_cmd_obj->GetSubcommandObject(sub_command.c_str(), &matches);
125 if (found_cmd == nullptr || matches.GetSize() > 1) {
136 if (matches.GetSize() >= 2) {
139 size_t num_matches = matches.GetSize();
141 s.Printf("\n\t%s", matches.GetStringAtIndex(match_idx));
165 // Don't use AliasExists here, that only checks exact name matches
[all...]
H A DCommandObjectMultiword.cpp43 StringList *matches) {
49 if (matches)
50 matches->AppendString(sub_cmd);
57 if (matches == nullptr)
58 matches = &local_matches;
60 AddNamesMatchingPartialString(m_subcommand_dict, sub_cmd, *matches);
66 sub_cmd = matches->GetStringAtIndex(0);
77 StringList *matches) {
78 return GetSubcommandSP(sub_cmd, matches).get();
183 StringList matches; local
42 GetSubcommandSP(llvm::StringRef sub_cmd, StringList *matches) argument
76 GetSubcommandObject(llvm::StringRef sub_cmd, StringList *matches) argument
367 GetSubcommandSP(llvm::StringRef sub_cmd, StringList *matches) argument
375 GetSubcommandObject(llvm::StringRef sub_cmd, StringList *matches) argument
[all...]
/freebsd-current/usr.sbin/mptutil/
H A Dmpt_cam.c78 ccb.cdm.matches = calloc(1, bufsize);
95 free(ccb.cdm.matches);
105 free(ccb.cdm.matches);
111 ccb.cdm.matches[0].type != DEV_MATCH_BUS) {
112 free(ccb.cdm.matches);
115 *path_id = ccb.cdm.matches[0].result.bus_result.path_id;
116 free(ccb.cdm.matches);
152 ccb.cdm.matches = calloc(1, bufsize);
169 free(ccb.cdm.matches);
179 free(ccb.cdm.matches);
[all...]
/freebsd-current/contrib/bmake/unit-tests/
H A Dvarmod-match.mk22 # * matches 0 or more characters
23 # ? matches 1 character
24 # \x matches the character 'x'
28 # matches exactly the word 'e', twice.
33 # The pattern character '?' matches exactly 1 character, the pattern character
34 # '*' matches 0 or more characters. The whole pattern matches all words that
40 # A pattern without placeholders only matches itself.
80 # [...] matches 1 character from the listed characters
81 # [^...] matches
[all...]
/freebsd-current/contrib/libarchive/tar/
H A Dsubst.c221 regmatch_t matches[10]; local
256 if (regexec(&rule->re, name, 10, matches, 0))
261 realloc_strncat(result, name, matches[0].rm_so);
267 name + matches[0].rm_so,
268 matches[0].rm_eo - matches[0].rm_so);
299 realloc_strncat(result, name + matches[c - '0'].rm_so, matches[c - '0'].rm_eo - matches[c - '0'].rm_so);
311 name += matches[
[all...]

Completed in 201 milliseconds

12345678910