/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-cov/ |
H A D | CoverageFilters.cpp | 19 bool NameCoverageFilter::matches( function in class:NameCoverageFilter 26 bool NameRegexCoverageFilter::matches( function in class:NameRegexCoverageFilter 36 bool NameWhitelistCoverageFilter::matches( function in class:NameWhitelistCoverageFilter 42 bool RegionCoverageFilter::matches( function in class:RegionCoverageFilter 49 bool LineCoverageFilter::matches( function in class:LineCoverageFilter 60 bool CoverageFilters::matches(const coverage::CoverageMapping &CM, function in class:CoverageFilters 63 if (Filter->matches(CM, Function)) 77 bool CoverageFiltersMatchAll::matches( function in class:CoverageFiltersMatchAll 81 if (!Filter->matches(CM, Function))
|
H A D | CoverageFilters.h | 30 virtual bool matches(const coverage::CoverageMapping &CM, function in class:llvm::CoverageFilter 48 bool matches(const coverage::CoverageMapping &CM, 52 /// Matches functions whose name matches a certain regular expression. 59 bool matches(const coverage::CoverageMapping &CM, 74 bool matches(const coverage::CoverageMapping &CM, 111 bool matches(const coverage::CoverageMapping &CM, 123 bool matches(const coverage::CoverageMapping &CM, 140 bool matches(const coverage::CoverageMapping &CM, 151 bool matches(const coverage::CoverageMapping &CM,
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | completer.h | 24 extern char *readline_line_completion_function (const char *text, int matches);
|
H A D | interps.c | 424 char **matches; local 431 matches = (char **) xmalloc (alloced * sizeof (char *)); 439 matches[num_matches] = 442 strcpy (matches[num_matches], interp->name); 446 strcpy (matches[num_matches], interp->name + (word - text)); 451 strncpy (matches[num_matches], word, text - word); 452 matches[num_matches][text - word] = '\0'; 453 strcat (matches[num_matches], interp->name); 461 xfree (matches); 462 matches [all...] |
/freebsd-11-stable/contrib/libreadline/ |
H A D | complete.c | 90 completing a word would normally display the list of possible matches. 92 It takes three arguments: (char **matches, int num_matches, int max_length) 137 /* If non-zero, non-unique completions always show the list of matches. */ 140 /* If non-zero, non-unique completions show the list of matches, unless it 192 /* Pointer to alternative function to create matches. 250 /* If non-zero, then disallow duplicates in the matches. */ 253 /* Non-zero means that the results of the matches are to be treated 258 /* Non-zero means that the results of the matches are to be quoted using 267 generated. It is passed a (char**) known as matches in the code below. 269 matching strings. The 1st element (matches[ 954 char **matches; local 1199 char *t, **matches, **temp_matches; local 1642 char **matches; local 1796 int matches; local 2120 static char **matches = (char **)0; local [all...] |
/freebsd-11-stable/lib/libedit/ |
H A D | filecomplete.c | 291 size_t matches; local 293 matches = 0; 295 while ((retstr = (*genfunc) (text, (int)matches)) != NULL) { 297 if (matches + 3 >= match_list_len) { 299 while (matches + 3 >= match_list_len) 310 match_list[++matches] = retstr; 320 for (; which <= matches; which++) { 337 match_list[matches + 1] = NULL; 356 * 'matches' is list of strings, 'num' is number of strings in 'matches', 363 fn_display_match_list(EditLine *el, char **matches, size_t num, size_t width) argument 427 char **matches; local [all...] |
/freebsd-11-stable/sys/isa/ |
H A D | isahint.c | 107 int line, matches, unit; local 129 matches = 0; 147 matches++; 154 matches++; 158 if (matches > 0) 162 matches++; 168 matches++; 174 if (matches > 0) {
|
/freebsd-11-stable/sys/dev/pci/ |
H A D | pci_user.c | 67 static int pci_conf_match(struct pci_match_conf *matches, int num_matches, 102 * structures. The first argument, 'matches', is an array of num_matches 104 * structure that will be compared to every entry in the matches array. 108 pci_conf_match(struct pci_match_conf *matches, int num_matches, argument 113 if ((matches == NULL) || (match_buf == NULL) || (num_matches <= 0)) 120 if (matches[i].flags == PCI_GETCONF_NO_MATCH) 128 if (((matches[i].flags & PCI_GETCONF_MATCH_DOMAIN) != 0) 130 matches[i].pc_sel.pc_domain)) 133 if (((matches[i].flags & PCI_GETCONF_MATCH_BUS) != 0) 134 && (match_buf->pc_sel.pc_bus != matches[ 263 uint32_t matches; /* match buffer member in struct:pci_conf_io32 281 pci_conf_match_old(struct pci_match_conf_old *matches, int num_matches, struct pci_conf *match_buf) argument 345 pci_conf_match_old32(struct pci_match_conf_old32 *matches, int num_matches, struct pci_conf *match_buf) argument [all...] |
/freebsd-11-stable/contrib/xz/src/liblzma/lz/ |
H A D | 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) 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 250 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 305 lzma_mf_hc3_find(lzma_mf *mf, lzma_match *matches) argument 366 lzma_mf_hc4_find(lzma_mf *mf, lzma_match *matches) argument 450 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 587 lzma_mf_bt2_find(lzma_mf *mf, lzma_match *matches) argument 620 lzma_mf_bt3_find(lzma_mf *mf, lzma_match *matches) argument 675 lzma_mf_bt4_find(lzma_mf *mf, lzma_match *matches) argument [all...] |
H A D | 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...] |
/freebsd-11-stable/contrib/xz/src/liblzma/lzma/ |
H A D | 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...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Commands/ |
H A D | CommandObjectMultiword.cpp | 30 StringList *matches) { 37 // An exact match; append the sub_cmd to the 'matches' string list. 38 if (matches) 39 matches->AppendString(sub_cmd); 43 if (matches == nullptr) 44 matches = &local_matches; 46 AddNamesMatchingPartialString(m_subcommand_dict, sub_cmd, *matches); 52 sub_cmd = matches->GetStringAtIndex(0); 64 StringList *matches) { 65 return GetSubcommandSP(sub_cmd, matches) 29 GetSubcommandSP(llvm::StringRef sub_cmd, StringList *matches) argument 63 GetSubcommandObject(llvm::StringRef sub_cmd, StringList *matches) argument 113 StringList matches; local 301 GetSubcommandSP(llvm::StringRef sub_cmd, StringList *matches) argument 309 GetSubcommandObject(llvm::StringRef sub_cmd, StringList *matches) argument [all...] |
H A D | CommandObjectHelp.cpp | 98 StringList matches; local 100 cmd_obj = m_interpreter.GetCommandObject(command_name, &matches); 103 StringList matches; local 111 matches.Clear(); 121 sub_cmd_obj->GetSubcommandObject(sub_command.c_str(), &matches); 122 if (found_cmd == nullptr || matches.GetSize() > 1) { 133 if (matches.GetSize() >= 2) { 136 size_t num_matches = matches.GetSize(); 138 s.Printf("\n\t%s", matches.GetStringAtIndex(match_idx)); 164 // Don't use AliasExists here, that only checks exact name matches [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/TableGen/ |
H A D | StringMatcher.h | 29 /// 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-11-stable/contrib/llvm-project/lldb/source/Utility/ |
H A D | RegularExpression.cpp | 25 llvm::SmallVectorImpl<llvm::StringRef> *matches) const { 28 return m_regex.match(str, matches);
|
H A D | CompletionRequest.cpp | 71 void CompletionResult::GetMatches(StringList &matches) const { 72 matches.Clear(); 74 matches.AppendString(completion.GetCompletion());
|
H A D | StringLexer.cpp | 43 bool matches = true; local 46 matches = false; 50 if (!matches) {
|
H A D | SharingPtr.cpp | 79 uint32_t matches = 0; local 83 ++matches; 88 if (matches == 0) {
|
/freebsd-11-stable/contrib/llvm-project/lldb/bindings/interface/ |
H A D | SBValueList.i | 148 matches = [] 152 matches.append(value) 153 return matches 158 matches = [] 163 matches.append(value) 164 return matches
|
/freebsd-11-stable/usr.sbin/mptutil/ |
H A D | mpt_cam.c | 79 ccb.cdm.matches = calloc(1, bufsize); 96 free(ccb.cdm.matches); 106 free(ccb.cdm.matches); 112 ccb.cdm.matches[0].type != DEV_MATCH_BUS) { 113 free(ccb.cdm.matches); 116 *path_id = ccb.cdm.matches[0].result.bus_result.path_id; 117 free(ccb.cdm.matches); 153 ccb.cdm.matches = calloc(1, bufsize); 170 free(ccb.cdm.matches); 180 free(ccb.cdm.matches); [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchers.h | 153 /// Example: \c DeclarationMatcher(anything()) matches all declarations, e.g., 173 /// matches "int X", but not "int Y". 185 /// matches "typedef int X", but not "using Y = int" 197 /// matches "typedef int X" and "using Y = int" 209 /// matches "using Y = int", but not "typedef int X" 215 /// typeAliasTemplateDecl() matches 225 /// Example matches X but not Y 246 /// Example matches Y but not X 271 /// Example matches Y but not X 304 /// Examples matches \ [all...] |
/freebsd-11-stable/contrib/libarchive/tar/ |
H A D | subst.c | 214 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); 283 realloc_strncat(result, name + matches[c - '0'].rm_so, matches[c - '0'].rm_eo - matches[c - '0'].rm_so); 295 name += matches[ [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Interpreter/ |
H A D | CommandObjectRegexCommand.cpp | 33 llvm::SmallVector<llvm::StringRef, 4> matches; local 34 if (pos->regex.Execute(command, &matches)) { 39 if (match_idx < matches.size()) { 40 const std::string match_str = matches[match_idx].str();
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Interpreter/ |
H A D | CommandObjectMultiword.h | 41 StringList *matches = nullptr) override; 44 StringList *matches = nullptr) override; 96 StringList *matches = nullptr) override; 99 StringList *matches = nullptr) override;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Driver/ToolChains/Arch/ |
H A D | SystemZ.cpp | 40 if (A->getOption().matches(options::OPT_mhtm)) 47 if (A->getOption().matches(options::OPT_mvx))
|