Lines Matching refs:next
305 struct rule *next; /* Next rule in the global list */ member
325 struct config *next; /* Next configuration in the state */ member
352 struct action *next; /* Next action for this state */ member
376 struct plink *next; /* The next propagate link */ member
502 for(i=0; i<amt-1; i++) actionfreelist[i].next = &actionfreelist[i+1]; in Action_new()
503 actionfreelist[amt-1].next = 0; in Action_new()
506 actionfreelist = actionfreelist->next; in Action_new()
536 ap = (struct action *)msort((char *)ap,(char **)&ap->next, in Action_sort()
549 newaction->next = *app; in Action_add()
813 for(rp=xp->rule; rp; rp=rp->next){ in FindRulePrecedences()
855 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
873 for(rp=lemp->rule; rp; rp=rp->next){ in FindFirstSets()
930 for(rp=lemp->rule; rp; rp=rp->next){ in FindStates()
1035 for(cfp=stp->cfp; cfp; cfp=cfp->next) cfp->status = INCOMPLETE; in buildshifts()
1038 for(cfp=stp->cfp; cfp; cfp=cfp->next){ in buildshifts()
1047 for(bcfp=cfp; bcfp; bcfp=bcfp->next){ in buildshifts()
1089 for(cfp=stp?stp->cfp:0; cfp; cfp=cfp->next){ in FindLinks()
1098 for(cfp=stp?stp->cfp:0; cfp; cfp=cfp->next){ in FindLinks()
1099 for(plp=cfp->bplp; plp; plp=plp->next){ in FindLinks()
1122 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ in FindFollowSets()
1131 for(cfp=lemp->sorted[i]->cfp; cfp; cfp=cfp->next){ in FindFollowSets()
1133 for(plp=cfp->fplp; plp; plp=plp->next){ in FindFollowSets()
1164 for(cfp=stp->cfp; cfp; cfp=cfp->next){ /* Loop over all configurations */ in FindActions()
1202 for(ap=stp->ap; ap && ap->next; ap=ap->next){ in FindActions()
1203 for(nap=ap->next; nap && nap->sp==ap->sp; nap=nap->next){ in FindActions()
1212 for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = LEMON_FALSE; in FindActions()
1215 for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ in FindActions()
1219 for(rp=lemp->rule; rp; rp=rp->next){ in FindActions()
1320 old->next = freelist; in deleteconfig()
1362 cfp->next = 0; in Configlist_add()
1365 currentend = &cfp->next; in Configlist_add()
1388 cfp->next = 0; in Configlist_addbasis()
1391 currentend = &cfp->next; in Configlist_addbasis()
1408 for(cfp=current; cfp; cfp=cfp->next){ in Configlist_closure()
1446 current = (struct config*)msort((char*)current,(char**)&(current->next), in Configlist_sort()
1485 nextcfp = cfp->next; in Configlist_eat()
1572 ppPrev = &pA->next; in Rule_merge()
1573 pA = pA->next; in Rule_merge()
1576 ppPrev = &pB->next; in Rule_merge()
1577 pB = pB->next; in Rule_merge()
1597 pNext = rp->next; in Rule_sort()
1598 rp->next = 0; in Rule_sort()
1719 for(i=0, rp=lem.rule; rp; rp=rp->next){ in main()
1723 for(rp=lem.rule; rp; rp=rp->next){ in main()
1896 char **next, in msort() argument
1903 offset = (unsigned long)((char*)next - (char*)list); in msort()
2409 rp->next = 0; in parseonetoken()
2413 psp->lastrule->next = rp; in parseonetoken()
3127 for(i=0; i<amt-1; i++) plink_freelist[i].next = &plink_freelist[i+1]; in Plink_new()
3128 plink_freelist[amt-1].next = 0; in Plink_new()
3131 plink_freelist = plink_freelist->next; in Plink_new()
3140 newlink->next = *plpp; in Plink_add()
3150 nextpl = from->next; in Plink_copy()
3151 from->next = *to; in Plink_copy()
3163 nextpl = plp->next; in Plink_delete()
3164 plp->next = plink_freelist; in Plink_delete()
3278 for(rp=lemp->rule; rp; rp=rp->next){ in Reprint()
3345 plp = plp->next;
3451 else cfp=cfp->next; in ReportOutput()
3454 for(ap=stp->ap; ap; ap=ap->next){ in ReportOutput()
3504 for(rp=lemp->rule; rp; rp=rp->next){ in ReportOutput()
4367 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4538 for(ap=stp->ap; ap; ap=ap->next){ in ReportTable()
4549 for(ap=stp->ap; ap; ap=ap->next){ in ReportTable()
4577 for(rp=lemp->rule; rp; rp=rp->next) rp->doesReduce = LEMON_FALSE; in ReportTable()
4579 for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){ in ReportTable()
4776 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4857 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4863 for(i=0, rp=lemp->rule; rp; rp=rp->next, i++){ in ReportTable()
4872 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
4879 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
4889 for(rp2=rp->next; rp2; rp2=rp2->next){ in ReportTable()
4905 for(rp=lemp->rule; rp; rp=rp->next){ in ReportTable()
5003 for(ap=stp->ap; ap; ap=ap->next){ in CompressTables()
5012 for(ap2=ap->next; ap2; ap2=ap2->next){ in CompressTables()
5032 for(ap=stp->ap; ap; ap=ap->next){ in CompressTables()
5037 for(ap=ap->next; ap; ap=ap->next){ in CompressTables()
5042 for(ap=stp->ap; ap; ap=ap->next){ in CompressTables()
5058 for(ap=stp->ap; ap; ap=ap->next){ in CompressTables()
5078 nextap = ap->next; in CompressTables()
5091 for(ap2=stp->ap; ap2 && (ap2==ap || ap2->sp!=rp->lhs); ap2=ap2->next){} in CompressTables()
5140 for(ap=stp->ap; ap; ap=ap->next){ in ResortStates()
5277 struct s_x1node *next; /* Next entry with the same hash */ member
5320 np = np->next; in Strsafe_insert()
5337 if( array.ht[h] ) array.ht[h]->from = &(newnp->next); in Strsafe_insert()
5338 newnp->next = array.ht[h]; in Strsafe_insert()
5351 if( x1a->ht[h] ) x1a->ht[h]->from = &(np->next); in Strsafe_insert()
5352 np->next = x1a->ht[h]; in Strsafe_insert()
5370 np = np->next; in Strsafe_find()
5445 struct s_x2node *next; /* Next entry with the same hash */ member
5488 np = np->next; in Symbol_insert()
5505 if( array.ht[h] ) array.ht[h]->from = &(newnp->next); in Symbol_insert()
5506 newnp->next = array.ht[h]; in Symbol_insert()
5522 if( x2a->ht[h] ) x2a->ht[h]->from = &(np->next); in Symbol_insert()
5523 np->next = x2a->ht[h]; in Symbol_insert()
5541 np = np->next; in Symbol_find()
5644 struct s_x3node *next; /* Next entry with the same hash */ member
5687 np = np->next; in State_insert()
5704 if( array.ht[h] ) array.ht[h]->from = &(newnp->next); in State_insert()
5705 newnp->next = array.ht[h]; in State_insert()
5719 if( x3a->ht[h] ) x3a->ht[h]->from = &(np->next); in State_insert()
5720 np->next = x3a->ht[h]; in State_insert()
5738 np = np->next; in State_find()
5784 struct s_x4node *next; /* Next entry with the same hash */ member
5827 np = np->next; in Configtable_insert()
5844 if( array.ht[h] ) array.ht[h]->from = &(newnp->next); in Configtable_insert()
5845 newnp->next = array.ht[h]; in Configtable_insert()
5859 if( x4a->ht[h] ) x4a->ht[h]->from = &(np->next); in Configtable_insert()
5860 np->next = x4a->ht[h]; in Configtable_insert()
5878 np = np->next; in Configtable_find()