/freebsd-11-stable/usr.bin/find/ |
H A D | find.c | 73 * 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 D | function.c | 77 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 977 f_group(PLAN *plan, FTSENT *entry) argument 1035 f_inum(PLAN *plan, FTSENT *entry) argument 1084 f_links(PLAN *plan, FTSENT *entry) argument 1131 f_name(PLAN *plan, FTSENT *entry) argument 1179 f_newer(PLAN *plan, FTSENT *entry) argument 1276 f_path(PLAN *plan, FTSENT *entry) argument 1292 f_perm(PLAN *plan, FTSENT *entry) argument 1394 f_regex(PLAN *plan, FTSENT *entry) argument 1474 f_size(PLAN *plan, FTSENT *entry) argument 1563 f_type(PLAN *plan, FTSENT *entry) argument 1629 f_user(PLAN *plan, FTSENT *entry) argument 1682 f_expr(PLAN *plan, FTSENT *entry) argument 1729 f_not(PLAN *plan, FTSENT *entry) argument 1748 f_or(PLAN *plan, FTSENT *entry) argument [all...] |
H A D | operator.c | 55 * 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-stable/sys/contrib/ngatm/netnatm/api/ |
H A D | unisap.c | 56 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 D | unisap.h | 45 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 D | cc_dump.c | 144 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 D | cc_port.c | 167 return (a1->type == a2->type && a1->plan == a2->plan &&
|
H A D | cc_user.c | 231 addr->addr.plan == conn->calling.addr.plan &&
|
H A D | cc_conn.c | 559 printf(",%d-%d", sap->addr.type, sap->addr.plan);
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/API/ |
H A D | SBThreadPlan.cpp | 234 SBThreadPlan plan = local 241 return LLDB_RECORD_RESULT(plan); 278 SBThreadPlan plan = local 285 return LLDB_RECORD_RESULT(plan); 317 SBThreadPlan plan = local 325 return LLDB_RECORD_RESULT(plan); 353 SBThreadPlan plan = local 360 return LLDB_RECORD_RESULT(plan); 387 SBThreadPlan plan = local 394 return LLDB_RECORD_RESULT(plan); 412 SBThreadPlan plan = local [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Target/ |
H A D | Thread.cpp | 259 // Tell any plans on the plan stacks that the thread is being destroyed since 262 for (auto plan : m_plan_stack) 263 plan->ThreadDestroyed(); 265 for (auto plan : m_discarded_plan_stack) 266 plan->ThreadDestroyed(); 268 for (auto plan : m_completed_plan_stack) 269 plan->ThreadDestroyed(); 276 // Push a ThreadPlanNull on the plan stack. That way we can continue 277 // assuming that the plan stack is never empty, but if somebody errantly asks 370 // not trace) - preset value - completed plan sto 1043 ThreadPlanSP &plan = m_plan_stack.back(); local 1057 ThreadPlanSP &plan = m_plan_stack.back(); local 1111 IsThreadPlanDone(ThreadPlan *plan) argument 1121 WasThreadPlanDiscarded(ThreadPlan *plan) argument 1395 ThreadPlanStepInRange *plan = local 1505 PrintPlanElement(Stream *s, const ThreadPlanSP &plan, lldb::DescriptionLevel desc_level, int32_t elem_idx) argument [all...] |
H A D | Process.cpp | 872 // Prefer a thread that has just completed its plan over another 3087 // case it was already set and some thread plan logic calls halt on its own. 4483 // to discard" fields of the plan we are running, and reset it on Clean or on 4562 ThreadPlanSP plan = thread.GetCompletedPlan(); 4563 if (plan == thread_plan_sp && plan->PlanSucceeded()) { 4566 // Restore the plan state so it will get reported as intended when we are 4577 // Restore the plan state and then force Private to false. We are going 4578 // to stop because of this plan so we need it to become a public plan o [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Target/ |
H A D | StopInfo.h | 82 // Sometimes the thread plan logic will know that it wants a given stop to 123 CreateStopReasonWithPlan(lldb::ThreadPlanSP &plan,
|
H A D | Thread.h | 204 // Do not override this function, it is for thread plan logic only 565 // creation in ways specific to that plan type. Also, it is often necessary 567 // keep a shared pointer to the sub-plan. But besides that, the shared 578 /// Queues the base plan for a thread. 587 /// Otherwise this plan will go on the end of the plan stack. 590 /// A shared pointer to the newly queued thread plan, or nullptr if the 591 /// plan could not be queued. 594 /// Queues the plan used to step one instruction from the current PC of \a 603 /// Otherwise this plan wil [all...] |
/freebsd-11-stable/sys/dev/vt/hw/vga/ |
H A D | vt_vga.c | 530 unsigned int i, j, plan, color, offset; local 540 * Write Mode 0 and write one byte to each plan separately. 544 * We first compute each byte: each plan contains one bit of the 577 for (plan = 0; plan < 4; ++plan) 578 plans[i * 4 + plan] |= 579 ((color >> plan) & 0x1) << (7 - j); 586 * all bytes, one plan at a time. 591 for (plan [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
H A D | LoopVectorizationPlanner.h | 221 /// A builder used to construct the current plan. 238 Optional<VectorizationFactor> plan(unsigned UserVF); 240 /// Use the VPlan-native path to plan how to best vectorize, return the best
|
H A D | LoopVectorize.cpp | 6444 // doesn't have a cost model that can choose which plan to execute if 6493 Optional<VectorizationFactor> LoopVectorizationPlanner::plan(unsigned UserVF) { 6543 LLVM_DEBUG(dbgs() << "Setting best plan to VF=" << VF << ", UF=" << UF 7733 Optional<VectorizationFactor> MaybeVF = LVP.plan(UserVF);
|
/freebsd-11-stable/contrib/wpa/src/drivers/ |
H A D | driver_nl80211_scan.c | 433 struct nlattr *plan = nla_nest_start(msg, i + 1); local 435 if (!plan) 442 "nl80211: sched scan plan no. %u: Invalid interval: %u", 454 "nl80211: sched scan plan no. %u: Invalid number of iterations: %u", 464 nla_nest_end(msg, plan); 468 * except the last plan, which will run infinitely. So if the 470 * last scan plan.
|
/freebsd-11-stable/sys/contrib/ngatm/netnatm/msg/ |
H A D | uni_ie.c | 2091 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 D | unistruct.h | 212 uint8_t plan; member in struct:uni_addr
|
/freebsd-11-stable/crypto/heimdal/lib/sqlite/ |
H A D | sqlite3.c | 3399 ** 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-stable/contrib/dtc/Documentation/ |
H A D | dtc-paper.tex | 56 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-stable/contrib/subversion/subversion/libsvn_wc/ |
H A D | wc-queries.sql | 1271 * ### But it would take a double table scan execution plan for it.
|