e_next
struct elist *e_next; /* list of completion points */
for (ep = sp->s_empty; ep; ep = ep->e_next) {
nep = ep->e_next;
nep = ep->e_next;
nep = ep->e_next;
for (ep = osp->s_empty; ep; ep = ep->e_next) {
for (nep = sp->s_empty; nep; nep = nep->e_next) {
nep->e_next = sp->s_nempty;
nextep = ep->e_next;
ep->e_next = NULL;
Last_expl->e_next = ep;
EXPL *e_next;
off_t e_next; /* set by elf_rand()/elf_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;
new->e_next = lastexecplus;
p = p->e_next;