Searched refs:pattern (Results 1 - 25 of 63) sorted by relevance

123

/barrelfish-2018-10-04/lib/libc/gen/
H A Dfnmatch.c46 * Compares a filename or pathname to a pattern.
79 fnmatch(const char *pattern, const char *string, int flags) argument
83 return (fnmatch1(pattern, string, string, flags, initial, initial));
87 fnmatch1(const char *pattern, const char *string, const char *stringstart, argument
99 pclen = mbrtowc(&pc, pattern, MB_LEN_MAX, &patmbs);
102 pattern += pclen;
128 c = *pattern;
131 c = *++pattern;
138 /* Optimize for pattern with * at end or before /. */
158 bt_pattern = pattern, bt_patmb
234 rangematch(const char *pattern, wchar_t test, int flags, char **newp, mbstate_t *patmbs) argument
[all...]
H A Dglob.c55 * Set in gl_flags if pattern contained a globbing character.
57 * Same as GLOB_NOCHECK, but it will only append pattern if it did
187 glob(const char * __restrict pattern, int flags, argument
198 patnext = pattern;
222 return (err_nomatch(pglob, &limit, pattern));
244 return (err_nomatch(pglob, &limit, pattern));
254 return (err_nomatch(pglob, &limit, pattern));
258 return (globexp0(patbuf, pglob, &limit, pattern));
260 return (glob0(patbuf, pglob, &limit, pattern));
264 globexp0(const Char *pattern, glob_ argument
293 globexp1(const Char *pattern, glob_t *pglob, struct glob_limit *limit) argument
316 globexp2(const Char *ptr, const Char *pattern, glob_t *pglob, struct glob_limit *limit) argument
420 globtilde(const Char *pattern, Char *patbuf, size_t patbuf_len, glob_t *pglob) argument
532 glob0(const Char *pattern, glob_t *pglob, struct glob_limit *limit, const char *origpat) argument
628 glob1(Char *pattern, glob_t *pglob, struct glob_limit *limit) argument
645 glob2(Char *pathbuf, Char *pathend, Char *pathend_last, Char *pattern, glob_t *pglob, struct glob_limit *limit) argument
715 glob3(Char *pathbuf, Char *pathend, Char *pathend_last, Char *pattern, Char *restpattern, glob_t *pglob, struct glob_limit *limit) argument
[all...]
/barrelfish-2018-10-04/kernel/
H A Dmemset.c92 uintptr_t num, align, pattern, *p, x; local
111 pattern = x | x << 8 | x << 16 | x << 24;
113 pattern = x | x << 8 | x << 16 | x << 24 |
122 *p++ = pattern;
123 *p++ = pattern;
124 *p++ = pattern;
125 *p++ = pattern;
128 *p++ = pattern;
/barrelfish-2018-10-04/lib/libc/tests/gen/
H A Dtest-fnmatch.c60 if (strchr(t->pattern, '\'') != NULL ||
63 if (t->flags == 0 && strcmp(t->pattern, "\\") == 0)
68 t->pattern, t->string);
70 (t->flags == 0 && strchr(t->pattern, '\\') == NULL)))
73 t->pattern, t->string);
H A Dfnmatch_test.c85 result = fnmatch(t->pattern, t->string, flags);
88 if (strchr(t->pattern, '\\') == NULL &&
91 result = fnmatch(t->pattern, t->string, flags);
96 if (strchr(t->pattern, '\\') != NULL &&
101 result = fnmatch(t->pattern, t->string, flags);
106 if ((t->string[0] != '.' || t->pattern[0] == '.' ||
110 result = fnmatch(t->pattern, t->string, flags);
119 result = fnmatch(t->pattern, t->string, flags);
124 if ((((t->string[0] != '.' || t->pattern[0] == '.') &&
129 result = fnmatch(t->pattern,
[all...]
H A Dfnmatch_testcases.h33 const char *pattern; member in struct:testcase
/barrelfish-2018-10-04/usr/lshw/
H A Dlshw.c39 const char *pattern; member in struct:opt_t
51 { "-free", 0, "Use free search pattern.", OPT_LIST_PATTERN },
61 fprintf(stderr, "Usage: %s <[option] | [pattern]>\n", name);
120 const char *pattern; local
138 pattern = option[opt].pattern;
144 pattern = argv[2];
160 err = oct_get_names(&names, &size, pattern);
/barrelfish-2018-10-04/usr/eclipseclp/documents/userman/
H A Dextmeta.tex68 \predspec{meta_attribute(\pattern{Name},~\pattern{HandlerList})}
83 \preddef{\pattern{Var}\{\pattern{Name_1}:\pattern{Attr_1},%
84 ~\pattern{Name_2}:\pattern{Attr_2},~\ldots,%
85 ~\pattern{Name_n}:\pattern{Attr_n}\}}
94 \notation{Var\{\pattern{Modul
[all...]
H A Dumsmacros.tex88 \item[local macro(+\pattern{TermClass}, +\pattern{TransPred},
89 +\pattern{Options})]
94 \item[export macro(+\pattern{TermClass}, +\pattern{TransPred},
95 +\pattern{Options})]
98 \item[erase_macro(+\pattern{TermClass}, +\pattern{Options})]
102 \item[current_macro(?\pattern{TermClass}, ?\pattern{TransPre
[all...]
H A Dumslanguage.tex134 Similarly, the whole \pattern{StructName/Arity} specification can be written as
282 \preddef{(~\pattern{IterationSpecs}~do~\pattern{Goals}~)}\indextt{do/2}
300 \item[fromto(\pattern{First},~\pattern{In},~\pattern{Out},~\pattern{Last})]%
308 \item[foreach(\pattern{X},~\pattern{List})]%
315 \item[foreacharg(\pattern{
[all...]
H A Dumsopsys.tex186 It takes a directory pathname and a file name pattern and returns a list
187 of subdirectories and a list of files matching the pattern.
188 The following metacharacters are recognised in the pattern:
239 \verb:~:\notation{\pattern{user}} or \notation{\$var}.
267 \item \preddef{sh(\pattern{Command})}\indextt{sh/1}
268 \item \preddef{exec(\pattern{Command},~\pattern{Streams})}\indextt{exec/2}
269 \item \preddef{exec(\pattern{Command},~\pattern{Streams},~\pattern{ProcessI
[all...]
H A Dumscompiler.tex70 \item[\biptxtref{compile(\pattern{Source})}{compile/1}{../bips/kernel/compiler/compile-1.html}]
75 \item[\biptxtref{compile(\pattern{Source},~\pattern{Options})}{compile/2}{../bips/kernel/compiler/compile-2.html}]
81 \item[\txtbipref{[\pattern{File1},...,\pattern{FileN}]}{(.)/2}{../bips/kernel/compiler/D-2.html}]
87 \item[\biptxtref{compile_stream(\pattern{Stream})}{compile_stream/1}{../bips/kernel/compiler/compile_stream-1.html}]
94 \item[\biptxtref{compile_stream(\pattern{Stream},~\pattern{Options})}{compile_stream/2}{../bips/kernel/compiler/compile_stream-2.html}]
97 \item[\biptxtref{compile_term(\pattern{Clauses})}{compile_term/1}{../bips/kernel/compiler/compile_term-1.html}]
105 \item[\biptxtref{compile_term(\pattern{Clause
[all...]
H A Dumsio.tex191 \biptxtref{open(\pattern{FileName},~\pattern{Mode},~\pattern{Stream})}{open/3}%
195 \biptxtref{open(string(\pattern{String}),~\pattern{Mode},~\pattern{Stream})}%
199 \biptxtref{open(queue(\pattern{String}),~\pattern{Mode},~\pattern{Stream})}%
254 If \about{SourceSink} is of the form \notation{string(\pattern{InitStrin
[all...]
H A Dexthsusp.tex276 Prolog unification, but rather unidirectional pattern matching
278 \index{pattern matching}
298 The reason for using pattern matching instead of unification
414 \predspec{suspend(\pattern{Goal}, \pattern{Prio}, \pattern{CondList})}
422 \notation{\pattern{Vars} \notation{->} \pattern{Cond}}
847 A goal is suspended on a trigger using the syntax \pattern{trigger(Name)}
961 \biptxtrefni{make_suspension(\pattern{Goa
[all...]
H A Dumsdynamic.tex73 \notation{:- dynamic \pattern{SpecList}.}\indextt{dynamic/1}
79 \notation{is_dynamic(\pattern{Name/Arity}).}
84 \notation{compile(\pattern{Somefile})}
197 \preddef{assert(\pattern{ProcClause})}\indextt{assert/1}
223 \preddef{retract(\pattern{Clause})}\indextt{retract/1}
H A Dumsmemory.tex308 \item [set_flag(gc_interval,~\pattern{Nbytes}):]
338 \item [statistics(gc_number,~\pattern{N}):]
342 \item [statistics(gc_collected,~\pattern{Bytes}):]
345 \item [statistics(gc_area,~\pattern{Bytes}):]
350 \item [statistics(gc_ratio,~\pattern{Percentage}):]
354 \item [statistics(gc_time,~\pattern{Seconds}):]
362 \item [set_flag(gc_interval_dict,~\pattern{N}):]
365 \item [statistics(dict_gc_number,~\pattern{N}):]
368 \item [statistics(dict_gc_time,~\pattern{Seconds}):]
H A Dumsarith.tex54 \item[\pattern{Result} is \pattern{Expression}]\indextt{is/2}
62 \item[\pattern{Expr1} $<$ \pattern{Expr2}]\indextt{</2}
66 \item[\pattern{Expr1} $>=$ \pattern{Expr2}]\indextt{>=/2}
70 \item[\pattern{Expr1} $>$ \pattern{Expr2}]\indextt{>/2}
74 \item[\pattern{Expr1} $=<$ \pattern{Expr
[all...]
H A Dumsexcept.tex196 \item[\biptxtref{event_after(+\pattern{EventId},~+\pattern{Time})}%
203 \item[\biptxtref{event_after_every(+\pattern{EventId},~+\pattern{Time})}%
210 \item[\biptxtref{events_after(+\pattern{EventList})}%
213 which contains events of the form \pattern{EventId-Time}, or
214 \pattern{EventId-every(Time)} (specifying a single
231 cancel_after_event(+\pattern{EventId},~-\pattern{Cancelled})}%
236 \item[\biptxtref{current_after_events(-\pattern{Event
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/icparc_solvers/
H A Deregex.c97 char *pattern; local
98 err = ec_get_string(arg, &pattern);
101 err = regcomp(pcompiled_reg, pattern, cflags);
113 char *pattern; local
116 err = ec_get_string(ec_arg(1), &pattern);
122 err = regcomp(preg, pattern, cflags);
/barrelfish-2018-10-04/lib/pcre/
H A Dpcreposix.c74 REG_EESCAPE, /* \ at end of pattern */
75 REG_EESCAPE, /* \c at end of pattern */
177 REG_BADPAT /* pattern too complicated */
186 "pattern error", /* BADPAT */
261 pattern the pattern to compile
269 regcomp(regex_t *preg, const char *pattern, int cflags) argument
285 preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr,
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/
H A Dballoonhelp.tcl18 ## clear ?pattern?
169 ;proc clear {{pattern .*}} {
171 foreach w [array names BalloonHelp $pattern] {
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/
H A Dmodes.pl57 programs. It takes as input a Prolog program and a goal pattern, and
59 will be called with, given the specified goal pattern. The mode
66 analysis with a given call pattern and prints the results in the form
155 (nonvar(M), pattern(M) ->
280 % apply the call pattern Call to all Clauses in the list Clauses,
390 % convert a call/exit pattern into a mixed representation goal term
412 % convert a Goal in mixed representation into its abstract pattern form
559 % pattern(P)
563 pattern(-).
564 pattern(
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Contrib/
H A Dtrees.pl15 and put_label work is worth noting: they build up a pattern which
20 with no duplications. put_label simultaneously builds up a pattern
21 to match the old tree and a pattern to match the new tree.
/barrelfish-2018-10-04/usr/eclipseclp/Opium/demo/
H A Ddigin.pl23 BUGGY: endless loop (direct recursion, exact pattern). \n').
H A Dyoyo1.pl34 (direct recursion, no exact pattern, loop occurs on backtracking).').

Completed in 105 milliseconds

123