/haiku-fatelf/src/apps/poorman/libhttpd/ |
H A D | match.h | 0 /* match.h - simple shell-style filename patcher 38 extern int match( const char* pattern, const char* string );
|
H A D | match.c | 0 /* match.c - simple shell-style filename matcher 33 #include "match.h" 38 match( const char* pattern, const char* string ) function
|
/haiku-fatelf/3rdparty/mmu_man/irc/Haiku/ |
H A D | gen_err_list.py | 16 match = re.match(r'#\s?define\s+(?P<define>\w+)\s+(?P<expr>.+)', line) variable 17 if match: 18 define = match.groupdict().get("define") 19 expr = match.groupdict().get("expr") 31 m = re.match(r"B_TO_POSIX_ERROR\((?P<expr>.*)\)", expr) 37 m = re.match(r"B_FROM_POSIX_ERROR\((?P<expr>.*)\)", expr) 43 m = re.match(r"\((?P<expr>.*)\)", expr) 49 m = re.match(r"(?P<expr>\w+)$", expr) 57 m = re.match( 94 match = re.match(r'\\t*case (?P<define>\\w+):', line) variable 98 match = re.match(r'\\t*//\\s+(?P<define>\\w+):*$', line) variable 103 match = re.match(r'\\t*return "(?P<str>.+)";', line) variable [all...] |
/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | idcache.c | 71 struct userid *match = NULL; local 77 match = tail; 82 if (match == NULL) 86 match = xmalloc (offsetof (struct userid, name) + strlen (name) + 1); 87 match->id.u = uid; 88 strcpy (match->name, name); 91 match->next = user_alist; 92 user_alist = match; 95 return match->name[0] ? match 153 struct userid *match = NULL; local [all...] |
H A D | filevercmp.c | 36 const char *match = NULL; local 44 match = NULL; 49 if (!match) 50 match = *str; 53 match = NULL; 56 return match;
|
/haiku-fatelf/src/bin/findutils/gnulib/lib/ |
H A D | idcache.c | 71 struct userid *match = NULL; local 77 match = tail; 82 if (match == NULL) 86 match = xmalloc (offsetof (struct userid, name) + strlen (name) + 1); 87 match->id.u = uid; 88 strcpy (match->name, name); 91 match->next = user_alist; 92 user_alist = match; 95 return match->name[0] ? match 153 struct userid *match = NULL; local [all...] |
H A D | rpmatch.c | 33 try (const char *response, const char *pattern, const int match, argument 52 return regexec (re, response, 0, NULL, 0) == 0 ? match : nomatch;
|
/haiku-fatelf/src/bin/zip/ |
H A D | deflate.c | 28 * string matches are performed only when the previous match ends. So it 32 * is used to find longer strings when a small match has been found. 60 * Initialize the "longest match" routines for a new file 115 error: DYN_ALLOC not yet supported in match.S or match32.asm 123 * Local data used by the "longest match" routines. 184 /* Length of the best match at previous step. Matches not greater than this 185 * are discarded. This is used in the lazy match evaluation. 199 /* Attempt to find a better match only when the current match is strictly 204 /* Insert new strings in the hash table only if the match lengt 418 register uch far *match; /* matched string */ local [all...] |
/haiku-fatelf/src/bin/gzip/ |
H A D | deflate.c | 24 * string matches are performed only when the previous match ends. So it 28 * is used to find longer strings when a small match has been found. 56 * Initialize the "longest match" routines for a new file 125 * Local data used by the "longest match" routines. 174 /* Length of the best match at previous step. Matches not greater than this 175 * are discarded. This is used in the lazy match evaluation. 189 /* Attempt to find a better match only when the current match is strictly 194 /* Insert new strings in the hash table only if the match length 203 /* Use a faster search when the previous match i 362 register uch *match; /* matched string */ local [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | auxv.h | 53 CORE_ADDR match, CORE_ADDR *valp);
|
/haiku-fatelf/src/libs/compat/freebsd_wlan/net80211/ |
H A D | ieee80211_ageq.h | 53 struct ieee80211_node *match);
|
/haiku-fatelf/src/tools/checkstyle/ |
H A D | checkstyle.py | 10 for match in matches: 11 printMatch(name, match, text) 12 highlights.append((match.start(), match.end(), name))
|
H A D | utils.py | 8 # prints match to stdout 9 def printMatch(name, match, source): 10 start = match.start() 11 end = match.end() 15 + "): '" + match.group().replace('\n','\\n') + "'"
|
/haiku-fatelf/src/libs/compat/freebsd_network/ |
H A D | fbsd_if_media.c | 174 struct ifmedia_entry *match; local 176 match = ifmedia_match(ifm, target, ifm->ifm_mask); 178 if (match == NULL) { 179 TRACE("ifmedia_set: no match for 0x%x/0x%x\n", 183 ifm->ifm_cur = match; 203 struct ifmedia_entry *match; local 221 match = ifmedia_match(ifm, newmedia, ifm->ifm_mask); 222 if (match == NULL) { 232 * Similarly, if best match changed (kernel debugger?). 236 (match 363 struct ifmedia_entry *match, *next; local [all...] |
/haiku-fatelf/src/bin/gdb/opcodes/ |
H A D | d10v-dis.c | 119 int match = 0; local 134 match = 1; 138 if (match == 0) 201 int match = 0; local 207 match = 1; 225 if (!match) 242 int match, num_match = 0; local 252 match = 0; 270 match = 1; 276 if (!match) [all...] |
/haiku-fatelf/src/add-ons/print/drivers/pdf/source/ |
H A D | Scanner.cpp | 139 bool match = c == ch; local 140 if (!match) UngetCh(c); 141 return match;
|
/haiku-fatelf/src/bin/network/tcpdump/libpcap/Win32/Src/ |
H A D | getnetent.c | 106 any(cp, match) 108 char *match; 113 for (mp = match; *mp; mp++)
|
/haiku-fatelf/headers/private/file_systems/ |
H A D | QueryParserUtils.h | 19 enum match { enum in namespace:QueryParser
|
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/ |
H A D | keys.h | 26 const xmlChar *match,
|
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | deflate.c | 18 * string matches are performed only when the previous match ends. So it 22 * is used to find longer strings when a small match has been found. 93 local void check_match OF((deflate_state *s, IPos start, IPos match, 120 ush good_length; /* reduce lazy search above this match length */ 121 ush max_lazy; /* do not perform lazy search above this match length */ 122 ush nice_length; /* quit search above this match length */ 691 * Initialize the "longest match" routines for a new zlib stream 719 * Set match_start to the longest match starting at the given string and 725 * OUT assertion: the match length is not greater than s->lookahead. 728 /* For 80x86 and 680x0, an optimized version will be provided in match 738 register Bytef *match; /* matched string */ local 879 register Bytef *match; /* matched string */ local 933 check_match( deflate_state *s, IPos start, IPos match, int length) argument [all...] |
/haiku-fatelf/src/kits/tracker/ |
H A D | TrackerString.cpp | 430 // (Makes it possible to match a '[' with the expression '[[]'). 441 bool match = false; local 449 while (!match && *pattern != ']' && *pattern != '\0') { 466 match = start <= testChar && testChar <= stop; 477 match = UTF8CharsAreEqual(string, pattern); 479 match = CharsAreEqual(testChar, *pattern, caseSensitivity); 483 if (!match) { 495 return (match ^ inverse) != 0; 542 bool match = false; local 548 while (!match [all...] |
/haiku-fatelf/src/bin/coreutils/src/ |
H A D | uniq.c | 231 /* Return false if two strings OLD and NEW match, true if not. 263 bool match, uintmax_t linecount) 266 : !match ? output_first_repeated 342 bool match; 353 match = !different (thisfield, prevfield, thislen, prevlen); 354 match_count += match; 365 if (!match) 367 if (match_count) /* a previous match */ 379 if (!match || output_later_repeated) 381 writeline (prevline, match, match_coun 261 writeline(struct linebuffer const *line, bool match, uintmax_t linecount) argument 341 bool match; local [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar9002/ |
H A D | ar9287_olc.c | 109 HAL_BOOL match; local 119 match = ath_ee_getLowerUpperIndex( 123 if (match) {
|
/haiku-fatelf/src/bin/rcs/ |
H A D | ident.c | 105 static int match P((FILE*)); 202 if ((c = match(file))) 228 match(fp) /* group substring between two KDELIM's; then do pattern match */ function
|
/haiku-fatelf/src/libs/zlib/ |
H A D | deflate.c | 18 * string matches are performed only when the previous match ends. So it 22 * is used to find longer strings when a small match has been found. 96 local void check_match OF((deflate_state *s, IPos start, IPos match, 118 ush good_length; /* reduce lazy search above this match length */ 119 ush max_lazy; /* do not perform lazy search above this match length */ 120 ush nice_length; /* quit search above this match length */ 1020 * Initialize the "longest match" routines for a new zlib stream 1051 * Set match_start to the longest match starting at the given string and 1057 * OUT assertion: the match length is not greater than s->lookahead. 1060 /* For 80x86 and 680x0, an optimized version will be provided in match 1069 register Bytef *match; /* matched string */ local 1217 register Bytef *match; /* matched string */ local [all...] |