Searched refs:plan (Results 1 - 18 of 18) sorted by relevance

/freebsd-11.0-release/usr.bin/find/
H A Dfind.c73 * process the command line and create a "plan" corresponding to the
79 PLAN *plan, *tail, *new; local
83 * it is, create the appropriate node type and add the new plan node
84 * to the end of the existing plan. The resulting plan is a linked
85 * list of plan nodes. For example, the string:
89 * results in the plan:
93 * in this diagram, `[-name foo]' represents the plan node generated
95 * plan->next pointer.
97 for (plan
174 find_execute(PLAN *plan, char *paths[]) argument
[all...]
H A Dfunction.c77 switch (plan->flags & F_ELG_MASK) { \
107 find_parsenum(PLAN *plan, const char *option, char *vp, char *endch) argument
117 plan->flags |= F_GREATER;
121 plan->flags |= F_LESSTHAN;
124 plan->flags |= F_EQUAL;
148 find_parsetime(PLAN *plan, const char *option, char *vp) argument
158 plan->flags |= F_GREATER;
162 plan->flags |= F_LESSTHAN;
165 plan->flags |= F_EQUAL;
213 plan
254 f_Xmin(PLAN *plan, FTSENT *entry) argument
299 f_Xtime(PLAN *plan, FTSENT *entry) argument
509 f_depth(PLAN *plan, FTSENT *entry) argument
606 f_exec(PLAN *plan, FTSENT *entry) argument
808 f_flags(PLAN *plan, FTSENT *entry) argument
872 f_fstype(PLAN *plan, FTSENT *entry) argument
972 f_group(PLAN *plan, FTSENT *entry) argument
1030 f_inum(PLAN *plan, FTSENT *entry) argument
1079 f_links(PLAN *plan, FTSENT *entry) argument
1126 f_name(PLAN *plan, FTSENT *entry) argument
1174 f_newer(PLAN *plan, FTSENT *entry) argument
1271 f_path(PLAN *plan, FTSENT *entry) argument
1287 f_perm(PLAN *plan, FTSENT *entry) argument
1389 f_regex(PLAN *plan, FTSENT *entry) argument
1469 f_size(PLAN *plan, FTSENT *entry) argument
1558 f_type(PLAN *plan, FTSENT *entry) argument
1624 f_user(PLAN *plan, FTSENT *entry) argument
1677 f_expr(PLAN *plan, FTSENT *entry) argument
1724 f_not(PLAN *plan, FTSENT *entry) argument
1743 f_or(PLAN *plan, FTSENT *entry) argument
[all...]
H A Doperator.c55 * destructively removes the top from the plan
60 PLAN *node; /* top node removed from the plan */
71 * Removes one expression from the plan. This is used mainly by
83 /* first pull the top node from the plan */
125 * replaces "parenthesized" plans in our search plan with "expr" nodes.
128 paren_squish(PLAN *plan) argument
131 PLAN *tail; /* pointer to tail of result plan */
132 PLAN *result; /* pointer to head of result plan */
140 while ((expr = yankexpr(&plan)) != NULL) {
148 /* add the expression to our result plan */
165 not_squish(PLAN *plan) argument
228 or_squish(PLAN *plan) argument
[all...]
/freebsd-11.0-release/sys/contrib/ngatm/netnatm/api/
H A Dunisap.c56 if (sve->plan != UNI_ADDR_E164)
62 if (sve->plan != UNI_ADDR_ATME)
142 if (sap->addr.plan == UNI_ADDR_E164) {
145 } else if (sap->addr.plan == UNI_ADDR_ATME) {
165 return (s1->type == s2->type && s1->plan == s2->plan &&
274 called->addr.plan != sap->addr.plan)
276 if (called->addr.plan == UNI_ADDR_E164) {
281 } else if (called->addr.plan
[all...]
H A Dunisap.h45 enum uni_addr_plan plan; /* addressing plan */ member in struct:unisve_addr
123 "bad address type/plan combination", \
124 "bad address plan/selector tag combination", \
H A Dcc_dump.c144 cc_dumpf(d, " %s %u ", plantab[sap->addr.plan], sap->addr.len);
145 if (sap->addr.plan == UNI_ADDR_E164)
285 (a->addr.plan < sizeof(ptab) / sizeof(ptab[0]) &&
286 ptab[a->addr.plan] != NULL) ? ptab[a->addr.plan] : "?",
H A Dcc_port.c167 return (a1->type == a2->type && a1->plan == a2->plan &&
H A Dcc_user.c231 addr->addr.plan == conn->calling.addr.plan &&
H A Dcc_conn.c559 printf(",%d-%d", sap->addr.type, sap->addr.plan);
/freebsd-11.0-release/contrib/llvm/tools/lldb/source/Target/
H A DThread.cpp317 // Tell any plans on the plan stacks that the thread is being destroyed since
320 for (auto plan : m_plan_stack)
321 plan->ThreadDestroyed();
323 for (auto plan : m_discarded_plan_stack)
324 plan->ThreadDestroyed();
326 for (auto plan : m_completed_plan_stack)
327 plan->ThreadDestroyed();
334 // Push a ThreadPlanNull on the plan stack. That way we can continue assuming that the
335 // plan stack is never empty, but if somebody errantly asks questions of a destroyed thread
673 // If we're at a breakpoint push the step-over breakpoint plan
1158 ThreadPlanSP &plan = m_plan_stack.back(); local
1175 ThreadPlanSP &plan = m_plan_stack.back(); local
1243 IsThreadPlanDone(ThreadPlan *plan) argument
1257 WasThreadPlanDiscarded(ThreadPlan *plan) argument
1557 ThreadPlanStepInRange *plan = static_cast<ThreadPlanStepInRange *>(thread_plan_sp.get()); local
1711 PrintPlanElement(Stream *s, const ThreadPlanSP &plan, lldb::DescriptionLevel desc_level, int32_t elem_idx) argument
[all...]
/freebsd-11.0-release/contrib/llvm/tools/lldb/include/lldb/Target/
H A DStopInfo.h126 // Sometimes the thread plan logic will know that it wants a given stop to stop or not,
173 CreateStopReasonWithPlan (lldb::ThreadPlanSP &plan,
H A DThread.h262 // Do not override this function, it is for thread plan logic only
745 // creation in ways specific to that plan type. Also, it is often necessary for
747 // pointer to the sub-plan.
758 /// Queues the base plan for a thread.
766 /// Otherwise this plan will go on the end of the plan stack.
769 /// A shared pointer to the newly queued thread plan, or nullptr if the plan could not be queued.
775 /// Queues the plan used to step one instruction from the current PC of \a thread.
782 /// Otherwise this plan wil
[all...]
/freebsd-11.0-release/sys/dev/vt/hw/vga/
H A Dvt_vga.c522 unsigned int i, j, plan, color, offset; local
532 * Write Mode 0 and write one byte to each plan separately.
536 * We first compute each byte: each plan contains one bit of the
569 for (plan = 0; plan < 4; ++plan)
570 plans[i * 4 + plan] |=
571 ((color >> plan) & 0x1) << (7 - j);
578 * all bytes, one plan at a time.
583 for (plan
[all...]
/freebsd-11.0-release/sys/contrib/ngatm/netnatm/msg/
H A Duni_ie.c2091 uni_print_tbl(NULL, addr->plan, plan_tbl, cx);
2093 if(addr->plan == UNI_ADDR_E164) {
2105 } else if(addr->plan == UNI_ADDR_ATME) {
2138 switch(addr->plan) {
2216 APP_BYTE(msg, (addr->type << 4) | addr->plan);
2219 APP_BYTE(msg, ext | (addr->type << 4) | addr->plan);
2232 decode_addr(struct uni_addr *addr, u_int ielen, struct uni_msg *msg, u_int plan) argument
2234 addr->plan = plan & 0xf;
2235 addr->type = (plan >>
2422 u_char c, plan; local
2536 u_char c, plan; local
[all...]
H A Dunistruct.h212 uint8_t plan; member in struct:uni_addr
/freebsd-11.0-release/crypto/heimdal/lib/sqlite/
H A Dsqlite3.c3399 ** WHERE clause might influence the choice of query plan for a statement,
3404 ** choice of query plan if the parameter is the left-hand side of a [LIKE]
10563 WherePlan plan; /* query plan for this element of the FROM clause */ member in struct:WhereLevel
10574 union { /* Information that depends on plan.wsFlags */
10581 } in; /* Used when plan.wsFlags&WHERE_IN_ABLE */
100544 WherePlan plan; /* The lookup strategy */ member in struct:WhereCost
[all...]
/freebsd-11.0-release/contrib/dtc/Documentation/
H A Ddtc-paper.tex56 booting a \texttt{ppc64} kernel without Open Firmware, and we plan
522 to the flattened device tree approach. We plan to remove the
/freebsd-11.0-release/contrib/subversion/subversion/libsvn_wc/
H A Dwc-queries.sql1260 * ### But it would take a double table scan execution plan for it.

Completed in 303 milliseconds