tnext
for (ksh_twalk(&ts, t); (ap = tnext(&ts)); ) {
for (ksh_twalk(&ts, tp); (te = tnext(&ts)); ) {
for (ksh_twalk(&ts, &taliases); (tp = tnext(&ts)) != NULL; )
struct tbl * tnext ARGS((struct tstate *));
while ((te = tnext(&ts))) {
for (x = p; x; x = x->tnext)
for (/*nothing*/; x && x->tnext; x = x->tnext)
x->tnext = n;
s = r->tnext;
for (q = p; q; q = q->tnext)
for (/*nothing*/; q && q->tnext; q = q->tnext)
q->tnext = p;
if (i == MAXPROPPAIRLEN || pair[i]->tnext) {
for (p = pair[pp->prop_no]; p; p = p->tnext) {
for (p = pair[pp->prop_no]; p; p = p->tnext) {
for (p = s; p; p = p->tnext) {
if (rpair[n]->tnext != NULL) {
for (r = q; r; r = r->tnext) {
for (t = p; t; t = t->tnext) {
"%s%p: next=%p tnext=%p\n", spc, p, p->next, p->tnext);
if (p->tnext)
print_proppair0(pri, p->tnext, level + 1);
struct prop_pair *tnext; /* next prop_pair in same proposal payload */