HomeSort by: relevance | last modified time | path
    Searched refs:PLAN (Results 1 - 6 of 6) sorted by relevancy

  /src/usr.bin/find/
extern.h 37 PLAN *find_create(char ***);
38 int find_execute(PLAN *, char **);
39 PLAN *find_formplan(char **);
40 int find_traverse(PLAN *, int (*)(PLAN *, void *), void *);
41 int f_expr(PLAN *, FTSENT *);
42 PLAN *not_squish(PLAN *);
43 PLAN *or_squish(PLAN *);
    [all...]
operator.c 52 static PLAN *yanknode(PLAN **);
53 static PLAN *yankexpr(PLAN **);
57 * destructively removes the top from the plan
59 static PLAN *
60 yanknode(PLAN **planp) /* pointer to top of plan (modified) */
62 PLAN *node; /* top node removed from the plan */
    [all...]
function.c 69 switch (plan->flags) { \
81 static int64_t find_parsenum(PLAN *, const char *, const char *, char *);
82 static void run_f_exec(PLAN *);
83 int f_always_true(PLAN *, FTSENT *);
84 int f_amin(PLAN *, FTSENT *);
85 int f_anewer(PLAN *, FTSENT *);
86 int f_asince(PLAN *, FTSENT *);
87 int f_atime(PLAN *, FTSENT *);
88 int f_cmin(PLAN *, FTSENT *);
89 int f_cnewer(PLAN *, FTSENT *)
    [all...]
find.c 63 * process the command line and create a "plan" corresponding to the
66 PLAN *
69 PLAN *plan, *tail, *new; local in function:find_formplan
73 * it is, create the appropriate node type and add the new plan node
74 * to the end of the existing plan. The resulting plan is a linked
75 * list of plan nodes. For example, the string:
79 * results in the plan:
83 * in this diagram, `[-name foo]' represents the plan node generate
    [all...]
option.c 158 PLAN *
162 PLAN *new;
find.h 66 enum ntype type; /* plan node type */
78 struct _plandata *_p_data[2]; /* PLAN trees */
99 } PLAN;
134 PLAN *(*create)(char ***, int, char *); /* create function */

Completed in 106 milliseconds