LIST_NEXT
p = LIST_NEXT(p, entries);
p = LIST_NEXT(p, entry);
p = LIST_NEXT(p, entry);
(var) && ((tvar) = LIST_NEXT((var), field), 1); \
fp = LIST_NEXT(&file, f_list)) {
pr = LIST_NEXT(&process, ps_list)) {
for (; cnt < maxcnt && pr != NULL; pr = LIST_NEXT(&process, ps_list)) {
next = LIST_NEXT(cb, link);
next = LIST_NEXT(cb, link);
cb = LIST_NEXT(cb, link))
cb = LIST_NEXT(cb, link))
cb = LIST_NEXT(cb, link)) {
doi = LIST_NEXT(doi, link));
exchange = LIST_NEXT(exchange, link))
exchange = LIST_NEXT(exchange, link))
exchange = LIST_NEXT(exchange, link)) {
exchange = LIST_NEXT(exchange, link)) {
exchange = LIST_NEXT(exchange, link))
LIST_NEXT(node, link);
attr = LIST_NEXT(attr, link))
attr = LIST_NEXT(attr, link))
attr = LIST_NEXT(attr, link))
for (attr = LIST_FIRST(attrs); attr; attr = LIST_NEXT(attr, link)) {
for (attr = LIST_FIRST(attrs); attr; attr = LIST_NEXT(attr, link)) {
next = LIST_NEXT(sa, link);
for (sa = LIST_FIRST(&sa_tab[i]); sa; sa = LIST_NEXT(sa, link))
for (sa = LIST_FIRST(&sa_tab[i]); sa; sa = LIST_NEXT(sa, link))
sa = LIST_NEXT(sa, link))
for (sa = LIST_FIRST(&sa_tab[i]); sa; sa = LIST_NEXT(sa, link))
for (sa = LIST_FIRST(&sa_tab[i]); sa; sa = LIST_NEXT(sa, link))
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link)) {
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link))
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link))
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link)) {
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link)) {
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link))
for (t = LIST_FIRST(&transport_list); t; t = LIST_NEXT(t, link)) {
next = LIST_NEXT(t, link);
method = LIST_NEXT(method, link))
method = LIST_NEXT(method, link))
LIST_NEXT(p, link))
for (v = LIST_FIRST(&virtual_listen_list); v; v = LIST_NEXT(v, link))
v2 = LIST_NEXT(v, link);
v = LIST_NEXT(v, link)) {
LIST_NEXT(p, link))
cert = LIST_NEXT(cert, link)) {
certh = LIST_NEXT(certh, link))
nextcur = LIST_NEXT(cur, base_entry);
p = LIST_NEXT(entry, base_entry);
if (LIST_NEXT(p, base_entry) == entry)
if (LIST_NEXT(cur, disk_entry) == NULL) {
if (LIST_NEXT(cur, base_entry) == NULL) {
next = LIST_NEXT(entry, base_entry);
for (curisr = LIST_FIRST(list); LIST_NEXT(curisr, isr_link) != NULL;
curisr = LIST_NEXT(curisr, isr_link)) {
scbp_next = LIST_NEXT(scbp, pending_links);
for (; child != NULL; child = LIST_NEXT(child, mii_list)) {
nchild = LIST_NEXT(child, mii_list);
child = LIST_NEXT(child, mii_list)) {
child = LIST_NEXT(child, mii_list))
child = LIST_NEXT(child, mii_list))
child = LIST_NEXT(child, mii_list))
child = LIST_NEXT(child, mii_list)) {
for (; child != NULL; child = LIST_NEXT(child, mii_list)) {
next = LIST_NEXT(pd, pd_next);
if (LIST_NEXT(child, mii_list) != NULL) {
std = LIST_NEXT(std, hnext))
sitd = LIST_NEXT(sitd, hnext))
nextex = LIST_NEXT(ux, inext);
for (ex = LIST_FIRST(&sc->sc_intrhead); ex; ex = LIST_NEXT(ex, inext))
for (f = LIST_FIRST(&usb_frag_freelist); f; f = LIST_NEXT(f, next))
for (p = LIST_FIRST(&usb_blk_freelist); p; p = LIST_NEXT(p, next)) {
nfp = LIST_NEXT(fp, f_list);
nfp = LIST_NEXT(nfp, f_list);
nqr = LIST_NEXT(qr, ps_sibling);
if (LIST_NEXT(pr, ps_sibling) != NULL) {
pr = LIST_NEXT(pr, ps_sibling);
pr = LIST_NEXT(pr, ps_list);
for (; pr != NULL; pr = LIST_NEXT(pr, ps_list)) {
rp = LIST_NEXT(rp, er_link);
if (LIST_NEXT(after, er_link) != NULL &&
((start + size) == LIST_NEXT(after, er_link)->er_start)) {
after->er_end = LIST_NEXT(after, er_link)->er_end;
nextr = LIST_NEXT(after, er_link);
LIST_NEXT(after, er_link)->er_start = start;
for (; rp != NULL; rp = LIST_NEXT(rp, er_link)) {
while ((pr = LIST_NEXT(pr, ps_pglist)) != NULL) {
blist = LIST_NEXT(blist, b_vnbufs);
blist = LIST_NEXT(blist, b_vnbufs);
nbp = LIST_NEXT(bp, b_vnbufs);
if (LIST_NEXT(bp, b_vnbufs) != NOLIST)
if (LIST_NEXT(bp, b_vnbufs) != NOLIST)
LIST_NEXT(bp, b_vnbufs) = NOLIST; \
p = LIST_NEXT(p, brt_next);
n = LIST_NEXT(n, brt_next);
n = LIST_NEXT(n, brt_next);
p = LIST_NEXT(n, brt_next);
p = LIST_NEXT(n, brt_next);
n = LIST_NEXT(n, brt_next);
n = LIST_NEXT(n, brt_next);
n = LIST_NEXT(n, brt_next);
p = LIST_NEXT(n, brt_next);
if (LIST_NEXT(session, session_list) == NULL)
session_tmp = LIST_NEXT(session, session_list);
session_tmp = LIST_NEXT(session_tmp, session_list);
tmp = LIST_NEXT((struct llinfo_arp *)iter, la_list);
tmp = LIST_NEXT(tmp, la_list);
(enm) = LIST_NEXT((enm), enm_list)); \
(step).e_enm = LIST_NEXT((enm), enm_list); \
KASSERT((LIST_NEXT(inp, inp_hash) == NULL) ||
(LIST_NEXT(inp, inp_hash) == _Q_INVALID));
KASSERT((LIST_NEXT(inp, inp_lhash) == NULL) ||
(LIST_NEXT(inp, inp_lhash) == _Q_INVALID));
p = q, q = LIST_NEXT(q, ipqe_q))
nq = LIST_NEXT(q, ipqe_q);
p = q, q = LIST_NEXT(q, ipqe_q)) {
nq = LIST_NEXT(q, ipqe_q);
nq = LIST_NEXT(q, ipqe_q);
paf6 = af6, af6 = LIST_NEXT(af6, ip6af_list))
paf6 = af6, af6 = LIST_NEXT(af6, ip6af_list)) {
(var) = LIST_NEXT(var, field))
(var) && ((tvar) = LIST_NEXT(var, field), 1); \
am_next = LIST_NEXT(am, am_list);
am_next = LIST_NEXT(&marker, am_list);
if ((nextaobj = LIST_NEXT(aobj, u_list)) != NULL) {
elt = LIST_NEXT(elt, list)) {
next = LIST_NEXT(elt, list);
for (; p != NULL && p->setId < setId; q = p, p = LIST_NEXT(p, entries));
for (; p != NULL && p->msgId < msgId; q = p, p = LIST_NEXT(p, entries));
set = LIST_NEXT(set, entries));
msg = LIST_NEXT(msg, entries));
nline = LIST_NEXT(cline, entries);
nqp = LIST_NEXT(qp, q);
lmp != NULL; lastlmp = lmp, lmp = LIST_NEXT(lmp, q))
qp != NULL; lqp = qp, qp = LIST_NEXT(qp, q)) {
for (; LIST_NEXT(mp_c, q) != NULL; mp_c = LIST_NEXT(mp_c, q));
for (map = LIST_FIRST(&maplist); map; map = LIST_NEXT(map, link)) {
mctx = LIST_NEXT(mctx, entry);
p = LIST_NEXT(p, nexthop_l);
p->nexthop->next_prefix = LIST_NEXT(p, nexthop_l);
next = LIST_NEXT(ctx, entry);
rib_dump_ctx = LIST_NEXT(ctx, entry);
next = LIST_NEXT(s, entry);
while ((next = LIST_NEXT(head, ll_struct)) != NULL &&
na = LIST_NEXT(a, entry);
na = LIST_NEXT(xa, entry);
ni = LIST_NEXT(i, entry);
ni = LIST_NEXT(xi, entry);
area = LIST_NEXT(area, entry);
na = LIST_NEXT(a, entry);
na = LIST_NEXT(xa, entry);
ni = LIST_NEXT(i, entry);
ni = LIST_NEXT(xi, entry);
area = LIST_NEXT(area, entry);
next_fl = LIST_NEXT(fl, lcklst);
peer = LIST_NEXT(peer, link))
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
p = LIST_NEXT(p, link))
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link))
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
p = LIST_NEXT(p, link)) {
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {
for (p = LIST_FIRST(&cfgstate.peerlist); p; p = LIST_NEXT(p, link)) {