SLIST_NEXT
(var) = SLIST_NEXT((var), field))
SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
SLIST_NEXT((slistelm), field) = (elm); \
SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
while (SLIST_NEXT(curelm, field) != (elm)) \
curelm = SLIST_NEXT(curelm, field); \
SLIST_NEXT(curelm, field) = \
SLIST_NEXT(SLIST_NEXT(curelm, field), field); \
SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
ie = SLIST_NEXT(ie, link);
for (i = nddates - 1; i >= 0; i--, dtwalk = SLIST_NEXT(dtwalk, dt_list))
KASSERT(SLIST_NEXT(pv0, pv_list) == NULL || pv0->pv_pa < SLIST_NEXT(pv0, pv_list)->pv_pa);
pv = SLIST_NEXT(pv0, pv_list);
pvp = &SLIST_NEXT(*pvp, pv_list);
SLIST_NEXT(new_pv, pv_list) = *pvp;
if (SLIST_NEXT(new_pv, pv_list)) {
VPRINTF("before pa %#lx\n", SLIST_NEXT(new_pv, pv_list)->pv_pa);
pv = SLIST_NEXT(pv, pv_list);
pv = SLIST_NEXT(pv, pv_list);
pv = SLIST_NEXT(pv, pv_list);
pvp = &SLIST_NEXT(*pvp, pv_link);
SLIST_NEXT(pv, pv_link) = *pvp; /* add to ... */
*prevptr = SLIST_NEXT(pv, pv_link); /* remove it! */
prevptr = &SLIST_NEXT(pv, pv_link); /* previous pointer */
for (pv = npv; pv; pv = SLIST_NEXT(pv, pv_link)) {
for (pv = npv; pv; pv = SLIST_NEXT(pv, pv_link)) {
pv = SLIST_NEXT(pv, pv_link);
for (; pv && !bad_alias; pv = SLIST_NEXT(pv, pv_link)) {
for (; pv; pv = SLIST_NEXT(pv, pv_link)) {
KASSERT(SLIST_NEXT(SLIST_FIRST(&md->pvh_list), pv_link) != NULL);
KASSERT(SLIST_NEXT(SLIST_FIRST(&md->pvh_list), pv_link) != NULL);
if (SLIST_NEXT(pv, pv_link) == NULL) {
pv = SLIST_NEXT(pv, pv_link);
pv = SLIST_NEXT(pv, pv_link);
pvp = &SLIST_NEXT(pv, pv_link);
*pvp = SLIST_NEXT(pv, pv_link); /* remove from list */
for (; (npv = SLIST_NEXT(pv, pv_list)) != NULL;
pvp = &SLIST_NEXT(pv, pv_list)) {
*pvp = SLIST_NEXT(pv, pv_list);
SLIST_NEXT(pv, pv_list) = newpv;
pvp = &SLIST_NEXT(pv, pv_list)) {
if (SLIST_NEXT(pv, pv_list) == NULL)
pvp = &SLIST_NEXT(*pvp, pv_link);
ndesc = SLIST_NEXT(desc, d_link);
ndesc = SLIST_NEXT(desc, d_link);
ndesc = SLIST_NEXT(desc, d_link);
if (SLIST_NEXT(d, link) == 0 ||
SLIST_NEXT(d, link)->ipl < ipl) {
if (SLIST_NEXT(d, link) == 0 ||
SLIST_NEXT(d, link)->ipl < ipl) {
if (!SLIST_NEXT(xbdreq, req_next)) {
SLIST_NEXT(elm, link) != NULL;
elm = SLIST_NEXT(elm, link));
sc->current_sensor = SLIST_NEXT(sc->current_sensor, i_list);
nxtdd = SLIST_NEXT(dd, dd_next);
nxtdd = SLIST_NEXT(dd, dd_next);
dd = SLIST_NEXT(dd, dd_next);
dd = SLIST_NEXT(dd, dd_next);
include_dir = SLIST_NEXT(include_dir,
cur_node = SLIST_NEXT(cur_node,links)) {
cur_func = SLIST_NEXT(cur_func, links))
cur_func != NULL && SLIST_NEXT(cur_func, links) != NULL;
cur_func = SLIST_NEXT(cur_func, links), func_count--) {
curnode = SLIST_NEXT(curnode, links);
if (SLIST_NEXT(curnode, links) == NULL) {
cursymbol = SLIST_NEXT(curnode, links)->symbol;
curnode = SLIST_NEXT(curnode, links);
node2 = SLIST_NEXT(node1, links);
q = SLIST_NEXT(p, pfrkt_workq);
next = SLIST_NEXT(p, pfrke_workq); /* XXX */
q = SLIST_NEXT(p, pfrkt_workq);
q = SLIST_NEXT(p, pfrkt_workq);
q = SLIST_NEXT(p, pfrke_workq);
kn = SLIST_NEXT(kn, kn_link);
next = SLIST_NEXT(iter, ts_pichain);
next = SLIST_NEXT(sip, sel_chain);
while ((q = SLIST_NEXT(p, m_tag_link)) != NULL)
p = SLIST_NEXT(p, m_tag_link);
((tvar) = SLIST_NEXT((var), field), 1); \
SLIST_NEXT(SLIST_NEXT((slistelm), field), field); \