e_next
struct gsserrmap__element *e, *e_next;
for (e = head->first; e; e = e_next) {
e_next = e->next;
SLIST_ENTRY(ggd_export) e_next;
SLIST_INSERT_HEAD(&exports, ex, e_next);
SLIST_REMOVE_HEAD(&exports, e_next);
SLIST_FOREACH(ex, &exports, e_next) {
ep->e_next = removelist;
ip->e_next = removelist;
for (ep = removelist; ep != NULL; ep = ep->e_next) {
prev = &ep->e_next;
*prev = ep->e_next;
for (ep = removelist; ep != NULL; ep = ep->e_next)
struct entry *e_next; /* hash chain list */
np->e_next = *epp;
for (np = np->e_next; np != NULL; np = np->e_next)
for (next = *prev; next != NULL; next = next->e_next) {
*prev = next->e_next;
prev = &next->e_next;
freelist = np->e_next;
ep->e_next = freelist;
if (ep->e_next != NULL)
tep->e_next =
(struct entry *)ep->e_next->e_index;
if (ep->e_next != NULL)
ep->e_next = &baseep[(long)ep->e_next];
for (ep = entry[inum % entrytblsize]; ep != NULL; ep = ep->e_next)
if (ep->e_next != NULL)
"next hashchain name: %s\n", myname(ep->e_next));
qh->e_next = td;
qh->e_next = td;
qh->e_next = td;
qh_x->e_next = NULL;
qh_intr->e_next = 0;
qh_ls->e_next = 0;
qh_ctl->e_next = 0;
qh_blk->e_next = 0;
qh_lst->e_next = td_lst;
(((sqh->e_next != NULL) && !(qh_e_next & UHCI_PTR_T)) ? 2 : 0));
struct uhci_td *e_next;
TAILQ_INSERT_TAIL(&sc->sc_events, ep, e_next);
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_FOREACH_SAFE(ep, &sc->sc_events, e_next, tmpep) {
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_ENTRY(g_mirror_event) e_next;
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_INSERT_TAIL(&sc->sc_events, ep, e_next);
TAILQ_FOREACH_SAFE(ep, &sc->sc_events, e_next, tmpep) {
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_FOREACH(ep, &sc->sc_events, e_next) {
TAILQ_ENTRY(g_raid_event) e_next;
TAILQ_INSERT_TAIL(&sc->sc_events, ep, e_next);
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_FOREACH_SAFE(ep, &sc->sc_events, e_next, tmpep) {
TAILQ_REMOVE(&sc->sc_events, ep, e_next);
TAILQ_ENTRY(g_raid3_event) e_next;
new->e_next = lastexecplus;
p = p->e_next;