l_next
struct link_map *l_next;
lnew->l_next = l;
if (l->l_next == NULL) {
l->l_next = alloc_line();
l->l_next->l_prev = l;
l = l->l_next;
for (; l->l_next; l = l->l_next)
lines = l->l_next;
if (l->l_line || l->l_next)
l->l_next = l + 1;
l->l_next = NULL;
line_freelist = l->l_next;
l->l_next = line_freelist;
LINE *l_next; /* next line */
current->l_next = last;
lp = lp->l_next;
nxt = current->l_next;
for (; lh != NULL; lh = lh->l_next) {
lh3 = lh2->l_next;
lh3 = lh3->l_next;
lh2 = lh2->l_next;
lh2 = lh2->l_next;
for (lh2 = lh; lh2 != NULL; lh2 = lh2->l_next) {
next = lp->l_next;
current->l_next = last;
el->l_next = head;
for (el = fnames; el != NULL; el = el->l_next) {
lp = lp->l_next;
lp = lp->l_next;
lp->l_next = linehead;
struct linelist *l_next; /* Chain ptr. */