Lines Matching refs:next
80 struct fme *next; /* next exercise */
135 struct case_list *next;
185 EFMElist->next = fmep;
456 nextcasep = ucasep->next;
465 sfp = fp->next;
473 sfp = fp->next;
871 bad->next = NULL;
874 bad->next = Undiagablecaselist;
1642 for (fmep = FMElist; fmep; fmep = fmep->next) {
1741 svfmep = cfmep->next;
1852 for (fmep = FMElist; fmep; fmep = fmep->next)
1981 for (nc = n; nc != NULL; nc = nc->u.name.next) {
2011 for (nc = n; nc != NULL; nc = nc->u.name.next) {
2444 ASSERT(snp->u.event.ename->u.name.next == NULL);
2467 np = np->u.name.next;
2474 np = np->u.name.next;
2483 np = np->u.name.next;
2492 np = np->u.name.next;
3061 newcase->next = NULL;
3064 newcase->next = Undiagablecaselist;
3164 for (ucasep = Undiagablecaselist; ucasep; ucasep = ucasep->next) {
3171 Undiagablecaselist = Undiagablecaselist->next;
3173 prevcasep->next = ucasep->next;
3179 for (fmep = FMElist; fmep; fmep = fmep->next) {
3195 FMElist = FMElist->next;
3197 prev->next = fmep->next;
3199 fmep->next = NULL;
3208 fmep->next = ClosedFMEs;
3216 for (fmep = FMElist; fmep; fmep = fmep->next) {
3277 for (ffmep = FMElist; ffmep; ffmep = ffmep->next)
3522 for (ctp = arrowp->constraints; ctp != NULL; ctp = ctp->next) {
3533 for (ctp = arrowp->constraints; ctp != NULL; ctp = ctp->next) {
3542 for (ctp = arrowp->constraints; ctp != NULL; ctp = ctp->next) {
3571 for (ctp = arrowp->constraints; ctp != NULL; ctp = ctp->next) {