plist
void plist(struct varent *);
plist(&shvhed);
plist(&aliases);
char *plist;
plist = *cdpathp;
if (!plist)
for (pend = plist; *pend && *pend != ':'; pend++)
plen = pend - plist;
if ((use_cdpath == 0 || !plen || plist[0] != '/') &&
memcpy(xp, plist, plen);
if (plist[plen - 1] != '/')
plist);
plist[i++] = op->sqr->name;
plist[i++] = "done";
plist[i--] = 0;
static char *plist[MAX_PRP+2];
int *pallorfirst, STACK_OF(GENERAL_NAMES) **plist,
int *pallorfirst, STACK_OF(GENERAL_NAMES) **plist,
if (plist)
*plist = NULL;
if (plist)
*plist = rr->receiptsFrom->d.receiptList;
struct pglist plist;
TAILQ_INIT(&plist);
L1_TABLE_SIZE, 0, &plist, 1, UVM_PLA_WAITOK);
m = TAILQ_FIRST(&plist);
struct dt_pcb_list plist;
TAILQ_INIT(&plist);
error = dtp->dtp_prov->dtpv_alloc(dtp, sc, &plist, dtrq);
TAILQ_CONCAT(&sc->ds_pcbs, &plist, dp_snext);
dt_pcb_purge(struct dt_pcb_list *plist)
while ((dp = TAILQ_FIRST(plist)) != NULL) {
TAILQ_REMOVE(plist, dp, dp_snext);
struct dt_pcb_list *plist, struct dtioc_req *dtrq)
TAILQ_INSERT_HEAD(plist, dp, dp_snext);
struct dt_pcb_list *plist, struct dtioc_req *dtrq)
KASSERT(TAILQ_EMPTY(plist));
dt_pcb_purge(plist);
TAILQ_INSERT_HEAD(plist, dp, dp_snext);
struct dt_pcb_list *plist, struct dtioc_req *dtrq)
KASSERT(TAILQ_EMPTY(plist));
TAILQ_INSERT_HEAD(plist, dp, dp_snext);
struct dt_pcb_list *plist, struct dtioc_req *dtrq)
KASSERT(TAILQ_EMPTY(plist));
TAILQ_INSERT_HEAD(plist, dp, dp_snext);
struct pglist plist;
TAILQ_INIT(&plist);
(i + 1) * PAGE_SIZE, &plist))
page = TAILQ_FIRST(&plist);
struct pglist plist;
TAILQ_INIT(&plist);
(i + 1) * PAGE_SIZE, &plist))
page = TAILQ_FIRST(&plist);
TAILQ_INIT(&plist);
if (uvm_obj_wire(obj->base.uao, 0, obj->base.size, &plist)) {
TAILQ_FOREACH(page, &plist, pageq) {
struct pglist plist;
TAILQ_INIT(&plist);
trunc_page(pos) + PAGE_SIZE, &plist)) {
page = TAILQ_FIRST(&plist);
struct pglist plist;
TAILQ_INIT(&plist);
trunc_page(offset) + PAGE_SIZE, &plist)) {
page = TAILQ_FIRST(&plist);
struct pglist plist;
struct pglist plist;
TAILQ_INIT(&plist);
if (uvm_obj_wire(uao, pgoff, olen, &plist))
TAILQ_FOREACH(page, &plist, pageq) {
struct pglist plist;
TAILQ_INIT(&plist);
if (uvm_obj_wire(uao, pgoff, olen, &plist))
TAILQ_FOREACH(page, &plist, pageq) {
#define priolist_for_each_request(it, plist) \
list_for_each_entry(it, &(plist)->requests, sched.link)
#define priolist_for_each_request_consume(it, n, plist) \
list_for_each_entry_safe(it, n, &(plist)->requests, sched.link)
struct pglist plist;
TAILQ_INIT(&plist);
&plist)) {
from_page = TAILQ_FIRST(&plist);
struct pglist plist;
TAILQ_INIT(&plist);
if (uvm_obj_wire(swap_storage, 0, size, &plist)) {
to_page = TAILQ_FIRST(&plist);
void knote_remove(struct proc *p, struct kqueue *kq, struct knlist **plist,
knote_remove(struct proc *p, struct kqueue *kq, struct knlist **plist, int idx,
while ((kn = SLIST_FIRST(*plist + idx)) != NULL) {
struct pglist plist;
TAILQ_INIT(&plist);
dma_constraint.ucr_high, 0, 0, &plist, atop(round_page(size)),
while ((pg = TAILQ_FIRST(&plist)) != NULL) {
TAILQ_REMOVE(&plist, pg, pageq);
struct pglist plist;
TAILQ_INIT(&plist);
0, &plist, atop(round_page(size)), flags);
while((pg = TAILQ_FIRST(&plist)) != NULL) {
TAILQ_REMOVE(&plist, pg, pageq);
| '(' plist ')' IN varname { $$ = op2(INTEST, $2, makearr($5)); }
| '(' plist ')' IN varname { $$ = op2(INTEST, $2, makearr($5)); }
plist:
| plist comma pattern { $$ = linkum($1, $3); }
| '(' plist ')' { $$ = $2; }
%type <p> pas pattern ppattern plist pplist patlist prarg term re
pkgconf_list_t plist = PKGCONF_LIST_INITIALIZER;
pkgconf_path_add(envvar, &plist, true);
pkgconf_path_add(pathbuf, &plist, true);
pkgconf_path_build_from_environ("XDG_DATA_DIRS", "/usr/local/share" PKG_CONFIG_PATH_SEP_S "/usr/share", &plist, true);
PKGCONF_FOREACH_LIST_ENTRY(plist.head, n)
pkgconf_path_free(&plist);
pkgconf_path_split(PERSONALITY_PATH, &plist, true);
PKGCONF_FOREACH_LIST_ENTRY(plist.head, n)
pkgconf_path_free(&plist);
plist = kvm_getprocs(kd, KERN_PROC_ALL, 0, sizeof(*plist), &nproc);
if (plist == NULL)
for (i = 0, kp = plist; i < nproc; i++, kp++) {
for (i = 0, kp = plist; i < nproc; i++, kp++) {
for (i = 0, kp = plist; i < nproc; i++, kp++) {
for (i = 0, j = 0, kp = plist; i < nproc; i++, kp++) {
struct kinfo_proc *plist;
print_prog_header(plist)
proc_list *plist;
print_generic_header(plist->args.argname, 1);
proc_list *plist;
for (plist = vlist->procs; plist != NULL; plist = plist->next) {
if (!newstyle || plist->arg_num < 2)
print_prog_header(plist);
for (dl = plist->args.decls; dl != NULL;
proc_list *plist;
for (plist = vers->procs; plist != NULL;
plist = plist->next) {
if (!newstyle || plist->arg_num < 2) {
name = plist->args.argname;
for (l = plist->args.decls;
proc_list *plist;
plist = malloc(sizeof(proc_list));
get_type(&plist->res_prefix, &plist->res_type,
if (streq(plist->res_type, "opaque")) {
plist->proc_name = tok.str;
plist->args.decls = decls;
plist->proc_num = tok.str;
plist->arg_num = num_args;
*ptailp = plist;
ptailp = &plist->next;
for (plist = vlist->procs; plist != NULL;
plist = plist->next) {
plist->args.argname = make_argname(plist->proc_name,
return_type(plist)
proc_list *plist;
ptype(plist->res_prefix, plist->res_type, 1);
internal_proctype(plist)
proc_list *plist;
ptype(plist->res_prefix, plist->res_type, 1);
char *ca_fp = NULL, **plist = NULL, *pin = NULL;
plist = NULL;
plist = xreallocarray(plist, n + 1, sizeof(*plist));
if (*(plist[n] = xstrdup(cp)) == '\0')
public->cert->principals = plist;
%type <v.probe> plist probe pname
rule : plist filter action { br_new($1, $2, $3); beflag = 0; }
plist : plist ',' probe { $$ = bp_append($1, $3); }
TAILQ_FOREACH_REVERSE(kprio, &kp->priorities, plist, entry) {
TAILQ_HEAD(plist, kroute_priority) priorities;
TAILQ_FOREACH_REVERSE(kprio, &kp->priorities, plist, entry) {
TAILQ_HEAD(plist, kroute_priority) priorities;